Quantifying consistency of a system architecture by comparing analyses of property graph data models representing different versions of the system architecture

ABSTRACT

A system and method generates two weighted property graph data models to represent a system architecture. The models each include a plurality of vertices representing a plurality of instances of a design dimension of the system architecture and a plurality of weighted compositional edges that connect first pairs of vertices to represent hierarchical directed-composition and hierarchical directed-decomposition of first pairs of instances of the design dimension represented by the corresponding connected first pairs of vertices with respect to one another, while only the first model includes a plurality of weighted interface edges that connect second pairs of the vertices to represent an information exchange interface between second pairs of instances of the design dimension represented by the corresponding connected second pairs of the vertices. Betweenness hierarchical clusters of each of the two models are generated and correlated with each other to quantify a consistency of the system architecture.

TECHNICAL FIELD

Embodiments generally relate to system architecture models, and moreparticularly to quantifying consistency of a system architecture bycomparing analyses of property graph data models representing differentversions of the system architecture.

BACKGROUND

When developing a system architecture, data regarding the physicalhierarchy and information exchange interfaces of the system facilitatean understanding of the system architecture. There are many differenttools used to design and develop different aspects of a systemarchitecture, so the data regarding the physical hierarchy andinformation exchange interfaces of the system are typically dispersedamong these various disparate tools in a variety of different forms.These tools may be utilized by various domains that contribute to thearchitecture development, yet utilize different languages and standardsin their software packages to allow development by the domain they areintended to serve. Some examples include system and software modelingtools, for example, IBM® RATIONAL® RHAPSODY® DESIGNER FOR SYSTEMSENGINEERS, No Magic, Inc.'s MAGICDRAW, Vitech Corporation's CORE™; ormechanical and electrical design tools, for example, PTC's CREO®,DASSAULT SYSTEMES' SOLIDWORKS, PTC's CREO SCHEMATIC™, and others.Computational analyses are typically performed on various aspects of thesystem design, but not the overall system architecture. An overallanalysis of the system architecture typically involves manual modelingand analysis by an expert, preparation of a report, and peerrequirements reviews and design reviews.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram that illustrates a data flow for generation ofa property graph data model representing a system architecture, inaccordance with some embodiments.

FIG. 2 is a block diagram that illustrates a graph schema, in accordancewith some embodiments.

FIG. 3 is a block diagram that illustrates a property graph according tothe graph schema of FIG. 2, in accordance with some embodiments.

FIG. 4 is a block diagram that illustrates a system for generating aproperty graph, in accordance with some embodiments.

FIG. 5 is a block diagram that illustrates a method of generating aproperty graph, in accordance with some embodiments.

FIGS. 6A and 6B are block diagrams that illustrate generating a weightedpart-to-part coupling graph based on a property graph, in accordancewith some embodiments.

FIG. 7 is a block diagram that illustrates a system for generating aweighted part-to-part coupling graph, in accordance with someembodiments.

FIG. 8 is a block diagram that illustrates a method of generating aweighted part-to-part coupling graph, in accordance with someembodiments.

FIG. 9 is a block diagram that illustrates quantifying consistency of asystem architecture, in accordance with some embodiments.

FIG. 10 is a graph that illustrates various exemplary computationanalysis results, in accordance with some embodiments.

FIG. 11 is a block diagram that illustrates a system for quantifyingconsistency of a system architecture, in accordance with someembodiments.

FIG. 12 is a block diagram that illustrates a method of quantifyingconsistency of a system architecture, in accordance with someembodiments.

FIG. 13 is a block diagram that illustrates quantifying robustness of asystem architecture, in accordance with some embodiments.

FIG. 14 is a block diagram that illustrates a system for quantifyingrobustness of a system architecture, in accordance with someembodiments.

FIG. 15 is a block diagram that illustrates a method of quantifyingrobustness of a system architecture, in accordance with someembodiments.

FIG. 16 is a resiliency profile graph that illustrates a resiliencyprofile of a few different iterations of a system architecture design,in accordance with some embodiments.

DETAILED DESCRIPTION

The following description and the drawings sufficiently illustratespecific embodiments to enable those skilled in the art to practicethem. Other embodiments may incorporate physical, functional, logical,electrical, process, cost, and other changes. Portions and features ofsome embodiments may be included in, or substituted for, those of otherembodiments. Embodiments set forth in the claims encompass all availableequivalents of those claims.

A property graph data model representing a system architecture mayfacilitate analyses of whole digital system models (DSMs), regardless oftheir complexity. The property graph data model may be generated basedon a variety of different databases and data files representingdifferent aspects, characteristics, and design dimensions of the systemarchitecture. These different databases and data files may be generatedby various different software tools. While the large volume of datapertaining to the system architecture in these different databases maybe too vast, too detailed, and too disconnected to be make sense ofdirectly, the property graph data model generated by formalizing thislarge volume of data into a consistent, unified representation may becomputationally analyzed to glean information about the systemarchitecture that may otherwise not be known from its disconnectedtoolsets and databases. The property graph data model may be a singlehierarchical representation that is computationally analyzable andscalable across various system architecture sizes and hierarchies from asmall system architecture, e.g., a sensor, to a large computer system,computer communications network, aerospace system, military defensesystem, etc.

The property graph data model may be considered a mathematicrepresentation of a system architecture design. System analysesperformed with data stored in the property graph data model may executemuch faster than with data stored in a relational database managementsystem (RDMS), because the property graph data model is much moreefficient with storing and accessing intricate, complex relationshipswith multiple connections. The property graph data model may also beextended to incorporate not only a self-consistent description of thesystem architecture design, but also information pertaining toproduction, testing, performance, reliability, faults, failures, andcosts of the system architecture, as well as other characteristics andaspects. The property graph data model may capture and specify therelationships between the different aspects, characteristics, and designdimensions of the system architecture. These relationships may then becomputationally analyzed using various analysis methods to obtaininformation about the quality, modularity, maturity, robustness,resiliency, reliability, and fragility of the system architecture, aswell as how well the physical system architecture aligns with thefunctional system architecture.

The property graph data model may be transformed into a weightedpart-to-part coupling graph to facilitate various types of analysesusing graph algorithms that are applicable for property graph analysisin general. The weighted part-to-part coupling graph data model may bean embodiment of the property graph data model. In the weightedpart-to-part coupling graph, the hierarchy of parts as constructed inthe property graph data model may be supplemented with weightedinterface edges connecting different parts according to the connectionsbetween parts in the property graph data model established by aninterface design dimension and a variety of factors, for example, thenumber or frequency of connections between parts, complexity of theinterfaces between parts, a number of signals included in the interfacebetween parts, and costs or defects associated with the connected parts.The weighting factors may be adjusted according to the application athand and the analyses that are to be performed using the part-to-partcoupling graph.

Using the part-to-part coupling graph, a consistency between thehierarchal decomposition of the physical system and the system'sinformation exchange interfaces as an embodiment of the functionalarchitecture may be analyzed by computationally creating clusters ofparts based on physical decomposition connections and informationexchange connections and comparing them. Previously, typical analysistechniques were largely manual endeavors by subject-matter experts thatreviewed system diagrams and reports on system architecture and design,and design reviews by skilled practitioners. These manual endeavors weresubjective, and therefore also lacked consistency and repeatability. Themanual endeavors also lacked the robustness to detect gaps ordiscontinuities between different viewpoints and toolsets in order toachieve a consistent architecture description for the system. There wasa reliance on individual software design, modeling, and simulation toolsat a detailed design level for various aspects of the system design,e.g., design and performance of individual parts of the design, but suchsoftware tools did not include an ability to quantify a consistency of asystem architecture design by comparing the information exchangeinterfaces between parts with the physical hierarchy or breakdown of theparts in the system architecture.

FIG. 1 is a block diagram that illustrates a data flow for generation ofa property graph data model 150 representing a system architecture, inaccordance with some embodiments. A system architecture may be designedusing a variety of tools, e.g., software applications for design,modeling and/or simulation of various aspects of the systemarchitecture. Thus, various portions of the system architecture may berepresented in different databases having different structures andstored in various data files having different file formats. Thesevarious different databases may be source databases 110 from whichrelevant characteristics pertaining to a system architecture may beaccessed for generating a single unified property graph data model 150that represents the entire system architecture for purposes ofsystem-level analysis, evaluation, and design. The relevantcharacteristics pertaining to the system architecture included in thesource databases 110 may include information pertaining to the design,modeling, simulation, manufacture, operation, testing, performance,reliability, faults, failure, cost, and evaluation of a systemarchitecture.

The source databases 110 may include information pertaining to manydimensions of the system architecture, for example, various partsincluded in the system architecture, information exchange interfacesbetween the various parts, information items exchanged between the partsthrough these interfaces, signals used to communicate the informationitems exchanged between the parts through the interfaces, functionsperformed by the parts, and system requirements or functionalrequirements for the various parts or functions performed by the variousparts. The source databases 110 may include, for example, data filesdescribing netlists for integrated circuits, printed circuit boards, andfield programmable gate arrays (FPGAs), hardware description languagemodels of the system architecture, etc.

Each dimension of the system architecture may also be represented atdifferent levels of a hierarchy. For example, parts of the systemarchitecture may be represented at a high level of the hierarchy asmodules, e.g., a computing rack. At the next lowest level of thehierarchy, the computing rack may be broken down into multiple bladesthat plug into the computing rack, where each of the blades may includea computing processor or other device, e.g., a network router, a networkfile storage controller, etc. At the next lowest level of the hierarchy,each of the blades may be broken down into various cards that plug intothe blade. At the next lowest level of the hierarchy, the various cardsmay be broken down into individual electronic parts that are attached tothe card, e.g., packaged semiconductor chips that are soldered onto thecard.

A format converter 120 may read data from the source databases 110,select appropriate data to be used for system architecture analyses andto be included in the property graph data model 150, and output theselected data to be stored in an intermediate format 130. The formatconverter 120 may select and formalize data from the source databases110 that are appropriate for analyzing one or more particular aspects ofthe system architecture. The intermediate format 130 may include aninternal data structure stored in memory or a data file stored in astorage device such as a hard disk drive or a flash drive. Theintermediate format 130 may have a consistent format regardless of thecharacteristics of the system architecture, the various tools used torepresent various aspects of the system architecture, and the variousformats and characteristics of the source databases 110. Theintermediate format 130 may bridge a gap between a high level of asystem architecture and a detailed design of the system architecture.The intermediate format 130 may include one or more files.

A graph constructor 140 may read the data stored in the intermediateformat 130 and formalize the system architecture into a graph byconstructing the property graph 150 to hierarchically represent thesystem architecture according to a graph schema as described elsewhereherein. The graph constructor 140 may be consistent for use for alltypes of system architectures, regardless of the characteristics of thesystem architecture, the various tools used to represent various aspectsof the system architecture, and the various formats and characteristicsof the source databases 110. The property graph data model 150 mayprovide a physical and functional view of the system architecturedesign. The property graph data model 150 may facilitate various typesof analyses of the system architecture, for example, quality of thesystem architecture, modularity of the system architecture, maturity ofthe system architecture, robustness of the system architecture,reliability of the system architecture, fragility of the systemarchitecture, and comparisons of these analyses between different systemarchitectures to understand relative rankings of different designs basedon these quantitative analyses.

FIG. 2 is a block diagram that illustrates a graph schema 200, inaccordance with some embodiments. The graph schema 200 may be commonacross all the tools used in association with the source databases 110of FIG. 1, and may therefore be considered tool-independent. The graphschema 200 represents relationships between different hierarchies ofvarious design dimensions and different elements of the various designdimensions at different levels of hierarchy.

The graph schema 200 includes two essential elements: vertices(illustrated as various shapes, including squares, circles, triangles,diamonds, hexagons, and octogons), and edges (illustrated as solid andbroken lines). The vertices may represent a class of design dimension,e.g., a part 210, an interface 220, an information item 230, a signal240, a function 250, and a requirement 260. While certain example designdimensions are represented by the illustrated vertices, this should notbe construed as limiting, as more or fewer design dimensions may berepresented in any specific embodiment of the graph schema 200. Forexample, in various embodiments, the graph schema 200 may only includedesign dimensions represented by vertices for part 210 and interface220. In various embodiments, design dimensions for operations performedon parts during manufacture may also be represented in the graph schema200. In various embodiments, a design dimension for serial numbers builtfrom parts within the design may also be represented in the graph schema200. In various embodiments, design dimensions for defects discovered inserial numbers by manufacturing operations may also be represented inthe graph schema 200.

Compositional edges (illustrated as broken lines) may representdirectional-decomposition (e.g., in the direction of the arrow) ordirectional-composition (e.g., opposite the direction of the arrow) ofthe class of design dimension represented by a vertex from one level ofa hierarchy to another level of the hierarchy. Directional-decompositionof a design dimension represented by a vertex may decompose the vertexat a higher hierarchical level into a plurality of vertexes at a lowerhierarchical level, and directional-composition of a design dimensionrepresented by the vertex may compose a single vertex at the higherhierarchical level from a plurality of vertexes at the lowerhierarchical level.

Connecting edges (illustrated as solid lines) may represent connectionsor relationships between different design dimensions (illustrated asvertices) of the system architecture. The directionality of the arrowsof the connecting edges shown in FIG. 2 represent the directions ofdefinition for the graph schema 200, not necessarily the direction ofdata flow of a system architecture represented by the graph schema 200.As illustrated, the interface 220 may connect to the part 210 and mayconnect from the part 210. This represents the relationship that parts210 may be connected to one another via information exchange interfaces220. Taken together, the connects-to and connects-from relationship pairembodies the direction of data flow from part to part. Bidirectionalinterfaces may be represented by connects-to and connects-fromconnecting edges directed to both endpoints on the information exchangeinterface. In various levels of a hierarchy, the interface 220 mayinclude a wiring harness, individual wires of the wiring harness, andcommunication protocols used to communicate via the individual wires ofthe wiring harness. For example, a high level interface might be awiring harness, while low level interface might be an Ethernetcommunication interface. Interfaces 220 that are hierarchicalintegrations of other interfaces 220 may connect to and connect fromparts 210 regardless of where the interface 220 is located in itscompositional hierarchy; however, to reduce graph data model ambiguity,care may be taken when constructing the property graph data model 150 inaccordance with the graph schema 200 to ensure that part end points areconsistent across the interface hierarchy by restricting the connects-toand connects-from connecting edges to only those interface vertices thatare leaf nodes in their respective composition/decomposition hierarchy.

As illustrated, the interface 220 contains signals 240. This representsthe relationship that various signals 240 may be communicated betweenthe parts 210 across the interfaces 220. The signals 240 represented atdifferent levels of the hierarchy may be connected to differenthierarchical levels of the interface 220. Examples of signals 240include a power voltage, a power ground, an electrical signal waveform,an optical signal, etc. As also illustrated, the interface 220 maytransfer information items 230, and the information items 230 maycontain signals 240. This represents that information items 230, e.g.,data, may be transferred across the interface 220 between differentparts 210. The information items 230 may also be represented atdifferent hierarchical levels, and the information items 230 atdifferent hierarchical levels may contain signals 240 at differenthierarchical levels. Examples of high-level information items mayinclude a packet definition for a communication protocol, and examplesof low-level information items may include a bit field within a packet.The information items 230 may be output from or input to functions 250.The functions 250 may be performed by the parts 210. The functions 250may also be based on requirements 260. The requirements 260 may specifythe parts 210 in the system architecture, for non-functionalrequirements. In general, any hierarchical level of a vertexrepresenting one design dimension may connect to any hierarchical levelof one or more other vertices representing different design dimensionsby connecting edges representing relationships between the differentdesign dimensions.

The graph schema 200 may be used within graph constructor 140 (see FIG.4) logic to construct property graphs conforming to the graph schema200, for example, property graph 300 in FIG. 3, which embodiesrequirement, function, part, interface, item, and signal vertex classesas well as compositional and connecting edges.

The graph schema 200 may also be related to the information included inthe intermediate format 130 of FIG. 1, and how that intermediate format130 is structured. For example, a product hierarchy file may include onerow for each unique part in the system architecture, a column for thepart name, and one column each for a parent and child hierarchical partname. An interface file may include one row for each unique interface inthe system architecture, and a column for each of a name of theinterface, part names that the interface connects to and connects from,the direction of information flow on the interface, and a column for anelectrical harness from which the interface is decomposed. A signal filemay include one row for each unique signal (e.g., electrical signal) inthe system architecture, and a column for each of a name of the signal,a name of an interface or information item that the contains the signal,a class name of the design dimension that the signal has a relationshipwith (e.g., interface or information item), and one column each for aparent and child hierarchical signal name. An information item file mayinclude one row for each unique information item in the systemarchitecture, and a column for each of a name of the information item,an interface name that transfer the information item or a signal namethat contains the information item, a class name of the design dimensionthat the information item has a relationship with (e.g., interface orsignal), and one column each for a parent and child hierarchicalinformation item name. The intermediate format 130 may include more orfewer files than discussed herein, and information relating to eachclass of design dimension may be included together in a same data fileor in a memory.

FIG. 3 is a block diagram that illustrates an exemplary property graph300 according to the graph schema 200 of FIG. 2, in accordance with someembodiments, A part A is at the highest hierarchical level of theproperty graph 300, and decomposes into parts A.1, A.2, and A.3 at asecond hierarchical level lower than the highest hierarchical level. Thepart A.1 decomposes into parts A.1.1 and A.1.2 at a third hierarchicallevel, the part A.2 decomposes into parts A.2.1, and A.2.2 at the thirdhierarchical level, and the part A.3 decomposes into parts A.3.1 andA.3.2 at the third hierarchical level. An interface X connects from thepart A.3.1 at the third hierarchical level and connects to the part A.2at the second hierarchical level. The interface X contains a signal U.The signal U is contained by an information item J, along with signals Sand T. An interface Z transfers an information item I, and the interfaceZ decomposes into interfaces Z.1 and Z.2 at a lower hierarchical level.The interface Z.1 connects from the part A.3.2 and connects to the partA.2.1. The interface Z.2 transfers the information item J that containsthe signals S, T, and U. The part A.3 performs a function F. Thefunction F decomposes into functions F.1 and F.2. The part A.3.2performs function F.1, while the part A.3.1 performs the function F.2. Arequirement R specifies the part A.3. The requirement R decomposes intorequirements R.1 and R.2. The function F.2 is performed on the basis ofthe requirement R.2.

Various computational network analyses may be performed using theproperty graph data model 300 to determine various metrics regarding thesystem architecture. These various analysis methods may obtaininformation about the quality, modularity, maturity, robustness,resiliency, reliability, and fragility of the system architecture, aswell as how well the physical system architecture aligns with thefunctional system architecture. Various other potential analysesproducing various other results and information may also be performedusing the property graph data model 300.

FIG. 4 is a block diagram that illustrates a system 400 for generating aproperty graph, in accordance with some embodiments. An example propertygraph 300 that may be generated by the system 400 is illustrated in FIG.3. The system 400 may include a computing processor 402 and a memorycircuit 404 that may store a data structure operated on by the computingprocessor 402, e.g., a data structure based on the graph schema 200 thatrepresents the property graph 300. The memory circuit 404 may also storea program that when executed by the computing processor 402 performs themethod 500 of FIG. 5. The elements of the system 400 may communicatewith one another via one or more connections or data buses 454.

A property graph may be an embodiment of a property graph data model,e.g., the property graph data model 150 of FIG. 1, that includes aplurality of vertices, a plurality of compositional edges, and aplurality of connecting edges in a data structure. The plurality ofcompositional edges may represent directed-composition anddirected-decomposition within a vertex type, and the plurality ofconnecting edges may represent connections between one vertex type andanother vertex type.

A database parser 406 may access one or more source databases, e.g.,source databases 110 of FIG. 1, including relevant characteristicspertaining to a system architecture. The relevant characteristicspertaining to the system architecture may include information pertainingto the design, modeling, simulation, manufacture, operation, testing,performance, reliability, faults, failure, cost, and evaluation of asystem architecture. The source databases may include data files forvarious hardware and/or software tools for design, modeling, andsimulation of devices, components, subsystems, and systems included inthe system architecture. The source databases may include a datastructure stored in the memory circuit 404. The database parser 406 mayinclude dedicated circuitry or logic that is permanently configured,e.g., as a special-purpose processor, such as an FPGA or anapplication-specific integrated circuit (ASIC), or programmable logic orcircuitry, e.g., the computing processor 402 that performs operationsaccording to instructions stored in the memory circuit 404.

A first information extractor 408 extract information pertaining to aplurality of first instances of a first design dimension of the systemarchitecture from the one or more source databases. The firstinformation extractor 408 may be included in an embodiment of the formatconverter 120 of FIG. 1. The first design dimension may be a partshierarchy of the system architecture. The plurality of first instancesmay be a plurality of parts of the system architecture. Some of theparts may be integrations of others of the parts, and therefore theparts that are integrations of others of the parts may be at a higherlevel of the hierarchy of parts than the others of the parts. Examplesof the parts hierarchy may be represented by the part 210 in the graphschema 200 and the parts A, A.1, A.2, A.3, A.1.1, A.1.2, A.2.1, A.2.2,A.3.1, and A.3.2 of FIG. 3. For example, a circuit card part may be anintegration of a plurality of integrated circuit parts and a printedcircuit board which the plurality of integrated circuit parts aremounted, so the circuit card part would be at a higher level of theparts hierarchy than the plurality of integrated circuit parts and thecircuit board part on which the plurality of integrated circuit partsare mounted. The first information extractor 408 may include dedicatedcircuitry or logic that is permanently configured, e.g., as aspecial-purpose processor, such as an FPGA or an ASIC, or programmablelogic or circuitry, e.g., the computing processor 402 that performsoperations according to instructions stored in the memory circuit 404.

A first vertex generator 410 may generate a first vertex in the propertygraph data model for each first instance of the plurality of firstinstances. The first vertex may represent the first instance. The firstvertex generator 410 may be included in an embodiment of the graphconstructor 140 of FIG. 1. The first vertex generator 410 may includededicated circuitry or logic that is permanently configured, e.g., as aspecial-purpose processor, such as an FPGA or an ASIC, or programmablelogic or circuitry, e.g., the computing processor 402 that performsoperations according to instructions stored in the memory circuit 404.

A first compositional edge generator 412 may generate a firstcompositional edge in the property graph data model for one or morefirst instances of the plurality of first instances. The firstcompositional edge may be connected to two different first vertices. Thefirst compositional edge may represent a hierarchicaldirected-composition or directed-decomposition of the first instancewith respect to another first instance of the plurality of firstinstances. The first compositional edge generator 412 may be included inan embodiment of the graph constructor 140 of FIG. 1. The firstcompositional edge generator 412 may include dedicated circuitry orlogic that is permanently configured, e.g., as a special-purposeprocessor, such as an FPGA or an AMC, or programmable logic orcircuitry, e.g., the computing processor 402 that performs operationsaccording to instructions stored in the memory circuit 404.

A second information extractor 414 may extract information from the oneor more source databases pertaining to a plurality of second instancesof a second design dimension of the system architecture. The secondinformation extractor 414 may be included in an embodiment of the formatconverter 120 of FIG. 1. The second design dimension may be an interfacehierarchy between the plurality of parts of the system architecture. Theplurality of second instances may be a plurality of interfaces betweenthe plurality of parts of the system architecture. Some of theinterfaces may be integrations of others of the interfaces, andtherefore the interfaces that are integrations of others of theinterfaces may be at a higher level of the hierarchy of interfaces thanthe others of the interfaces. Examples of the hierarchy of interfacesmay be represented by the interface 220 in the graph schema 200 and theinterfaces Z, Z.1, Z.2, and X of FIG. 3. For example, a wiring harnessmay be an integration of a plurality of individual wires, and eachindividual wire may be an integration of a plurality of communicationprotocol connections, e.g., Ethernet connections, so the wiring harnesswould be at a higher level of the interface hierarchy than the pluralityof wires, and each wire would be at a higher level of the interfacehierarchy than the plurality of communication protocol connections,e.g., Ethernet connections. The second information extractor 414 mayinclude dedicated circuitry or logic that is permanently configured,e.g., as a special-purpose processor, such as an FPGA or an ASIC, orprogrammable logic or circuitry, e.g., the computing processor 402 thatperforms operations according to instructions stored in the memorycircuit 404.

A second vertex generator 416 may generate a second vertex in theproperty graph data model for each second instance of the plurality ofsecond instances. The second vertex may represent the second instance.The second vertex generator 416 may be included in an embodiment of thegraph constructor 140 of FIG. 1. The second vertex generator 416 mayinclude dedicated circuitry or logic that is permanently configured,e.g., as a special-purpose processor, such as an FPGA or an ASIC, orprogrammable logic or circuitry, e.g., the computing processor 402 thatperforms operations according to instructions stored in the memorycircuit 404.

A second compositional edge generator 418 may generate a secondcompositional edge in the property graph data model, for one or moresecond instances of the plurality of second instances. The secondcompositional edge may be connected to two different second vertices.The second compositional edge may represent a hierarchicaldirected-composition or directed-decomposition of the second instancewith respect to another second instance of the plurality of secondinstances. The second compositional edge generator 418 may be includedin an embodiment of the graph constructor 140 of FIG. 1. The secondcompositional edge generator 418 may include dedicated circuitry orlogic that is permanently configured, e.g., as a special-purposeprocessor, such as an FPGA or an ASIC, or programmable logic orcircuitry, e.g., the computing processor 402 that performs operationsaccording to instructions stored in the memory circuit 404.

A second connecting edge generator 420 may generate a second connectingedge in the property graph data model, for one or more second instancesof the plurality of second instances. The second connecting edge mayrepresent a connection between the second instance and a first instanceof the plurality of first instances. The second connecting edge mayrepresent that an interface represented by a second instance connectedto one end of the second connecting edge is connected for the purpose ofinformation exchange to a part represented by a first instance connectedto the other end of the second connecting edge. The second connectingedge generator 420 may be included in an embodiment of the graphconstructor 140 of FIG. 1. The second connecting edge generator 420 mayinclude dedicated circuitry or logic that is permanently configured,e.g., as a special-purpose processor, such as an FPGA or an ASIC, orprogrammable logic or circuitry, e.g., the computing processor 402 thatperforms operations according to instructions stored in the memorycircuit 404.

A third information extractor 422 may extract information pertaining toa plurality of third instances of a third design dimension of the systemarchitecture from the one or more source databases. The thirdinformation extractor 422 may be included in an embodiment of the formatconverter 120 of FIG. 1. The third design dimension may be aninformation item hierarchy. The plurality of third instances may be aplurality of information items transferred via the plurality ofinterfaces of the system architecture. Some of the information items maybe integrations of others of the information items, and therefore theinformation items that are integrations of others of the informationitems may be at a higher level of the hierarchy of information itemsthan the others of the information items. Examples of the hierarchy ofinformation items may be represented by the information item 230 in thegraph schema 200 and the information items I and J of FIG. 3. The thirdinformation extractor 422 may include dedicated circuitry or logic thatis permanently configured, e.g., as a special-purpose processor, such asan FPGA or an ASIC, or programmable logic or circuitry, e.g., thecomputing processor 402 that performs operations according toinstructions stored in the memory circuit 404.

A third vertex generator 424 may generate a third vertex in the propertygraph data model for each third instance of the plurality of thirdinstances. The third vertex may represent the third instance. The thirdvertex generator 424 may be included in an embodiment of the graphconstructor 140 of FIG. 1. The third vertex generator 424 may includededicated circuitry or logic that is permanently configured, e.g., as aspecial-purpose processor, such as an FPGA or an ASIC, or programmablelogic or circuitry, e.g., the computing processor 402 that performsoperations according to instructions stored in the memory circuit 404.

A third compositional edge generator 426 may generate a thirdcompositional edge in the property graph data model for one or morethird instances of the plurality of third instances. The thirdcompositional edge may be connected to two different third vertices. Thethird compositional edge may represent a hierarchicaldirected-composition or directed-decomposition of one third instancewith respect to another third instance of the plurality of thirdinstances. The third compositional edge generator 426 may be included inan embodiment of the graph constructor 140 of FIG. 1. The thirdcompositional edge generator 426 may include dedicated circuitry orlogic that is permanently configured, e.g., as a special-purposeprocessor, such as an FPGA or an ASIC, or programmable logic orcircuitry, e.g., the computing processor 402 that performs operationsaccording to instructions stored in the memory circuit 404.

A third connecting edge generator 428 may generate a third connectingedge in the property graph data model, for one or more third instancesof the plurality of third instances. The third connecting edge mayrepresent a connection between the third instance and a first instanceof the plurality of first instances or a second instance of theplurality of second instances. The third connecting edge may representthat an information item represented by a third instance connected toone end of the third connecting edge is connected to an interfacerepresented by a second instance connected to the other end of the thirdconnecting edge, designating that the information item is transferred bythe interface. The third connecting edge generator 428 may be includedin an embodiment of the graph constructor 140 of FIG. 1. The thirdconnecting edge generator 428 may include dedicated circuitry or logicthat is permanently configured, e.g., as a special-purpose processor,such as an FPGA or an ASIC, or programmable logic or circuitry, e.g.,the computing processor 402 that performs operations according toinstructions stored in the memory circuit 404.

A fourth information extractor 430 may extract information pertaining toa plurality of fourth instances of a fourth design dimension of thesystem architecture from the one or more source databases. The fourthinformation extractor 430 may be included in an embodiment of the formatconverter 120 of FIG. 1. The fourth design dimension may be a functionhierarchy. The plurality of fourth instances may be a plurality offunctions performed by the plurality of parts of the systemarchitecture. Some of the functions may be integrations of others of thefunctions, and therefore the functions that are integrations of othersof the functions may be at a higher level of the hierarchy of functionsthan the others of the functions. Examples of the hierarchy of functionsmay be represented by the function 250 in the graph schema 200 and thefunctions F, F.1, and F.2 of FIG. 3. The fourth information extractor430 may include dedicated circuitry or logic that is permanentlyconfigured, e.g., as a special-purpose processor, such as an FPGA or anASIC, or programmable logic or circuitry, e.g., the computing processor402 that performs operations according to instructions stored in thememory circuit 404.

A fourth vertex generator 432 may generate a fourth vertex in theproperty graph data model for each fourth instance of the plurality offourth instances. The fourth vertex may represent the fourth instance.The fourth vertex generator 432 may be included in an embodiment of thegraph constructor 140 of FIG. 1. The fourth vertex generator 432 mayinclude dedicated circuitry or logic that is permanently configured,e.g., as a special-purpose processor, such as an FPGA or an ASIC, orprogrammable logic or circuitry, e.g., the computing processor 402 thatperforms operations according to instructions stored in the memorycircuit 404.

A fourth compositional edge generator 434 may generate a fourthcompositional edge in the property graph data model for one or morefourth instances of the plurality of fourth instances. The fourthcompositional edge may be connected to two different fourth vertices.The fourth compositional edge may represent a hierarchicaldirected-composition or directed-decomposition of one fourth instancewith respect to another fourth instance of the plurality of fourthinstances. The fourth compositional edge generator 434 may be includedin an embodiment of the graph constructor 140 of FIG. 1. The fourthcompositional edge generator 434 may include dedicated circuitry orlogic that is permanently configured, e.g., as a special-purposeprocessor, such as an FPGA or an ASIC, or programmable logic orcircuitry, the computing processor 402 that performs operationsaccording to instructions stored in the memory circuit 404.

A fourth connecting edge generator 436 may generate a fourth connectingedge in the property graph data model, for one or more fourth instancesof the plurality of fourth instances. The fourth connecting edge mayrepresent a connection between the fourth instance and a first instanceof the plurality of first instances, a second instance of the pluralityof second instances, or a third instance of the plurality of thirdinstances. The fourth connecting edge may represent that a functionrepresented by a fourth instance connected to one end of the fourthconnecting edge is connected to a part represented by a first instanceconnected to the other end of the fourth connecting edge, designatingthat the function is performed by the part. The fourth connecting edgemay represent that a function represented by a fourth instance connectedto one end of the fourth connecting edge is connected to an informationitem represented by a third instance connected to the other end of thefourth connecting edge, designating that the information item is inputto the function or the information item is output from the function. Thefourth connecting edge generator 436 may be included in an embodiment ofthe graph constructor 140 of FIG. 1. The fourth connecting edgegenerator 436 may include dedicated circuitry or logic that ispermanently configured, e.g., as a special-purpose processor, such as anFPGA or an AMC, or programmable logic or circuitry, e.g., the computingprocessor 402 that performs operations according to instructions storedin the memory circuit 404.

A fifth information extractor 438 may extract information pertaining toa plurality of fifth instances of a fifth design dimension of the systemarchitecture from the one or more source databases. The fifthinformation extractor 438 may be included in an embodiment of the formatconverter 120 of FIG. 1. The fifth design dimension may be a functionhierarchy. The plurality of fifth instances may be a plurality ofrequirements based on the plurality of functions performed by theplurality of parts of the system architecture. Some of the requirementsmay be integrations of others of the requirements, and therefore therequirements that are integrations of others of the requirements may beat a higher level of the hierarchy of requirements than the others ofthe requirements. Examples of the hierarchy of requirements may berepresented by the requirement 260 in the graph schema 200 and therequirements R, R.1, and R.2 of FIG. 3.

A fifth vertex generator 440 may generate a fifth vertex in the propertygraph data model for each fifth instance of the plurality of fifthinstances. The fifth vertex may represent the fifth instance. The fifthvertex generator 440 may be included in an embodiment of the graphconstructor 140 of FIG. 1. The fifth vertex generator 440 may includededicated circuitry or logic that is permanently configured, e.g., as aspecial-purpose processor, such as an FPGA or an AMC, or programmablelogic or circuitry, e.g., the computing processor 402 that performsoperations according to instructions stored in the memory circuit 404.

A fifth compositional edge generator 442 may generate a fifthcompositional edge in the property graph data model for one or morefifth instances of the plurality of fifth instances. The fifthcompositional edge may be connected to two different fifth vertices. Thefifth compositional edge may represent a hierarchicaldirected-composition or directed-decomposition of one fifth instancewith respect to another fifth instance of the plurality of fifthinstances. The fifth compositional edge generator 442 may be included inan embodiment of the graph constructor 140 of FIG. 1. The fifthcompositional edge generator 442 may include dedicated circuitry orlogic that is permanently configured, e.g., as a special-purposeprocessor, such as an FPGA or an ASIC, or programmable logic orcircuitry, e.g., the computing processor 402 that performs operationsaccording to instructions stored in the memory circuit 404.

A fifth connecting edge generator 444 may generate a fifth connectingedge in the property graph data model, for one or more fifth instancesof the plurality of fifth instances. The fifth connecting edge mayrepresent a connection between the fifth instance and a first instanceof the plurality of first instances, a second instance of the pluralityof second instances, a third instance of the plurality of thirdinstances, or a fourth instance of the plurality of fourth instances.The fifth connecting edge may represent that a requirement representedby a fifth instance connected to one end of the fifth connecting edge isconnected to a function represented by a fourth instance connected tothe other end of the fifth connecting edge, designating that thefunction is based on the requirement. The fifth connecting edge mayrepresent that a requirement represented by a fifth instance connectedto one end of the fifth connecting edge is connected to a partrepresented by a first instance connected to the other end of the fifthconnecting edge, designating that the part is based on the requirement.The fifth connecting edge generator 444 may be included in an embodimentof the graph constructor 140 of FIG. 1. The fifth connecting edgegenerator 444 may include dedicated circuitry or logic that ispermanently configured, e.g., as a special-purpose processor, such as anFPGA or an ASIC, or programmable logic or circuitry, e.g., the computingprocessor 402 that performs operations according to instructions storedin the memory circuit 404.

A sixth information extractor 446 may extract information pertaining toa plurality of sixth instances of a sixth design dimension of the systemarchitecture from the one or more source databases. The sixthinformation extractor 446 may be included in an embodiment of the formatconverter 120 of FIG. 1. The sixth design dimension may be a signalhierarchy. The plurality of sixth instances may be a plurality ofsignals communicated via the plurality of interfaces between theplurality of parts of the system architecture or communicating at leastone information item of the plurality of information items of the systemarchitecture. Some of the signals may be integrations of others of thesignals, and therefore the signals that are integrations of others ofthe signals may be at a higher level of the hierarchy of signals thanthe others of the signals. Examples of the hierarchy of signals may berepresented by the signal 240 in the graph schema 200 and the signals S,T, and U of FIG. 3. The fifth connecting edge generator 444 may beincluded in an embodiment of the graph constructor 140 of FIG. 1. Thesixth information extractor 446 may include dedicated circuitry or logicthat is permanently configured, e.g., as a special-purpose processor,such as an FPGA or an ASIC, or programmable logic or circuitry, e.g.,the computing processor 402 that performs operations according toinstructions stored in the memory circuit 404.

A sixth vertex generator 448 may generate a sixth vertex in the propertygraph data model for each sixth instance of the plurality of sixthinstances. The sixth vertex may represent the sixth instance. The sixthvertex generator 448 may be included in an embodiment of the graphconstructor 140 of FIG. 1. The sixth vertex generator 448 may includededicated circuitry or logic that is permanently configured, e.g., as aspecial-purpose processor, such as an FPGA or an ASIC, or programmablelogic or circuitry, e.g., the computing processor 402 that performsoperations according to instructions stored in the memory circuit 404.

A sixth compositional edge generator 450 may generate a sixthcompositional edge in the property graph data model for one or moresixth instances of the plurality of sixth instances. The sixthcompositional edge may be connected to two different sixth vertices. Thesixth compositional edge may represent a hierarchicaldirected-composition or directed-decomposition of one sixth instancewith respect to another sixth instance of the plurality of sixthinstances. The sixth compositional edge generator 450 may be included inan embodiment of the graph constructor 140 of FIG. 1. The sixthcompositional edge generator 450 may include dedicated circuitry orlogic that is permanently configured, e.g., as a special-purposeprocessor, such as an FPGA or an ASIC, or programmable logic orcircuitry, e.g., the computing processor 402 that performs operationsaccording to instructions stored in the memory circuit 404.

A sixth connecting edge generator 452 may generate a sixth connectingedge in the property graph data model, for one or more sixth instancesof the plurality of sixth instances. The sixth connecting edge mayrepresent a connection between the sixth instance and a first instanceof the plurality of first instances, a second instance of the pluralityof second instances, a third instance of the plurality of thirdinstances, a fourth instance of the plurality of fourth instances, or afifth instance of the plurality of fifth instances. The sixth connectingedge may represent that a signal represented by a sixth instanceconnected to one end of the sixth connecting edge is connected to aninterface represented by a second instance connected to the other end ofthe sixth connecting edge, designating that the signal is included inthe interface. The sixth connecting edge may represent that a signalrepresented by a sixth instance connected to one end of the sixthconnecting edge is connected to an information item represented by athird instance connected to the other end of the sixth connecting edge,designating that the signal is included in the information item. Thesixth connecting edge generator 452 may be included in an embodiment ofthe graph constructor 140 of FIG. 1. The sixth connecting edge generator452 may include dedicated circuitry or logic that is permanentlyconfigured, e.g., as a special-purpose processor, such as an FPGA or anASIC, or programmable logic or circuitry, e.g., the computing processor402 that performs operations according to instructions stored in thememory circuit 404.

FIG. 5 is a block diagram that illustrates a method 500 of generating aproperty graph, in accordance with some embodiments. The method 500 maybe performed by the system 400 of FIG. 4. FIG. 3 illustrates an exampleproperty graph 300 that may be generated by the method 500. The propertygraph may be an embodiment of a property graph data model, e.g., theproperty graph data model 150 of FIG. 1, that includes a plurality ofvertices, a plurality of compositional edges, and a plurality ofconnecting edges in a data structure. The plurality of compositionaledges may represent directed-composition and directed-decompositionwithin a vertex type, and the plurality of connecting edges mayrepresent connections between one vertex type and another vertex type.The data structure may be stored in a memory circuit (e.g., the memorycircuit 404) of a computer system having a computing processor (e.g.,the computing processor 402).

In an operation 502, one or more source databases, such as sourcedatabases 110 of FIG. 1, may be accessed by the computing processor. Theoperation 502 may be performed by the database parser 406 of FIG. 4. Thesource databases may include relevant characteristics pertaining to asystem architecture. The relevant characteristics pertaining to thesystem architecture may include information pertaining to the design,modeling, simulation, manufacture, operation, testing, performance,reliability, faults, failure, cost, and evaluation of a systemarchitecture. The source databases may include data files for varioushardware and/or software tools for design, modeling, and simulation ofdevices, components, subsystems, and systems included in the systemarchitecture. The source databases may include a data structure storedin a memory circuit of the computer system, e.g., the memory circuit404.

In an operation 504, information pertaining to a plurality of firstinstances of a first design dimension of the system architecture may beextracted from the one or more source databases. The operation 504 maybe performed by the first information extractor 408 of FIG. 4 or anembodiment of the format converter 120 of FIG. 1. The first designdimension may be a parts hierarchy of the system architecture. Theplurality of first instances may be a plurality of parts of the systemarchitecture. Some of the parts may be integrations of others of theparts, and therefore the parts that are integrations of others of theparts may be at a higher level of the hierarchy of parts than the othersof the parts. Examples of the parts hierarchy may be represented by thepart 210 in the graph schema 200 and the parts A, A.1, A.2, A.3, A.1.1,A.1.2, A.2.1, A.2.2, A.3.1, and A.3.2 of FIG. 3. For example, a circuitcard part may be an integration of a plurality of integrated circuitparts and a printed circuit board on which the plurality of integratedcircuit parts are mounted, so the circuit card part would be at a higherlevel of the parts hierarchy than the plurality of integrated circuitparts and the circuit board part on which the plurality of integratedcircuit parts are mounted.

In an operation 506, for each first instance of the plurality of firstinstances, a first vertex may be generated in the property graph datamodel. The operation 506 may be performed by the first vertex generator410 of FIG. 4 or an embodiment of the graph constructor 140 of FIG. 1.The first vertex may represent the first instance.

In an operation 508, for one or more first instances of the plurality offirst instances, a first compositional edge may be generated in theproperty graph data model. The operation 508 may be performed by thefirst compositional edge generator 412 of FIG. 4 or an embodiment of thegraph constructor 140 of FIG. 1. The first compositional edge may beconnected to two different first vertices. The first compositional edgemay represent a hierarchical directed-composition ordirected-decomposition of one first instance with respect to anotherfirst instance of the plurality of first instances.

In an operation 510, information pertaining to a plurality of secondinstances of a second design dimension of the system architecture may beextracted from the one or more source databases. The operation 510 maybe performed by the second information extractor 414 of FIG. 4 or anembodiment of the format converter 120 of FIG. 1. The second designdimension may be an interface hierarchy between the plurality of partsof the system architecture. The plurality of second instances may be aplurality of interfaces between the plurality of parts of the systemarchitecture. Some of the interfaces may be integrations of others ofthe interfaces, and therefore the interfaces that are integrations ofothers of the interfaces may be at a higher level of the hierarchy ofinterfaces than the others of the interfaces. Examples of the hierarchyof interfaces may be represented by the interface 220 in the graphschema 200 and the interfaces Z, Z.1, Z.2, and X of FIG. 3, For example,a wiring harness may be an integration of a plurality of individualwires, and each individual wire may be an integration of a plurality ofcommunication protocol connections, e.g., Ethernet connections, so thewiring harness would be at a higher level of the interface hierarchythan the plurality of wires, and each wire would be at a higher level ofthe interface hierarchy than the plurality of communication protocolconnections, e.g., Ethernet connections.

In an operation 512, for each second instance of the plurality of secondinstances, a second vertex may be generated in the property graph datamodel. The operation 512 may be performed by the second vertex generator416 of FIG. 4 or an embodiment of the graph constructor 140 of FIG. 1.The second vertex may represent the second instance.

In an operation 514, for one or more second instances of the pluralityof second instances, a second compositional edge may be generated in theproperty graph data model. The operation 514 may be performed by thesecond compositional edge generator 418 of FIG. 4 or an embodiment ofthe graph constructor 140 of FIG. 1. The second compositional edge maybe connected to two different second vertices. The second compositionaledge may represent a hierarchical directed-composition ordirected-decomposition of one second instance with respect to anothersecond instance of the plurality of second instances.

In an operation 516, for one or more second instances of the pluralityof second instances, a second connecting edge may be generated in theproperty graph data model. The operation 516 may be performed by thesecond connecting edge generator 420 of FIG. 4 or an embodiment of thegraph constructor 140 of FIG. 1. The second connecting edge mayrepresent a connection between the second instance and a first instanceof the plurality of first instances. The second connecting edge mayrepresent that an interface represented by a second instance connectedto one end of the second connecting edge is connected for the purpose ofinformation exchange to a part represented by a first instance connectedto the other end of the second connecting edge.

In an operation 518, information pertaining to a plurality of thirdinstances of a third design dimension of the system architecture may beextracted from the one or more source databases. The operation 518 maybe performed by the third information extractor 422 of FIG. 4 or anembodiment of the format converter 120 of FIG. 1. The third designdimension may be an information item hierarchy. The plurality of thirdinstances may be a plurality of information items transferred via theplurality of interfaces of the system architecture. Some of theinformation items may be integrations of others of the informationitems, and therefore the information items that are integrations ofothers of the information items may be at a higher level of thehierarchy of information items than the others of the information items.

In an operation 520, for each third instance of the plurality of thirdinstances, a third vertex may be generated in the property graph datamodel. The operation 520 may be performed by the third vertex generator424 of FIG. 4 or an embodiment of the graph constructor 140 of FIG. 1.The third vertex may represent the third instance.

In an operation 522, for one or more third instances of the plurality ofthird instances, a third compositional edge may be generated in theproperty graph data model. The operation 522 may be performed by thethird compositional edge generator 426 of FIG. 4 or an embodiment of thegraph constructor 140 of FIG. 1. The third compositional edge may beconnected to two different third vertices. The third compositional edgemay represent a hierarchical directed-composition ordirected-decomposition of one third instance with respect to anotherthird instance of the plurality of third instances.

In an operation 524, for one or more third instances of the plurality ofthird instances, a third connecting edge may be generated in theproperty graph data model. The operation 524 may be performed by thethird connecting edge generator 428 of FIG. 4 or an embodiment of thegraph constructor 140 of FIG. 1. The third connecting edge may representa connection between the third instance and a first instance of theplurality of first instances or a second instance of the plurality ofsecond instances. The third connecting edge may represent that aninformation item represented by a third instance connected to one end ofthe third connecting edge is connected to an interface represented by asecond instance connected to the other end of the third connecting edge,designating that the information item is transferred by the interface.

In an operation 526, information pertaining to a plurality of fourthinstances of a fourth design dimension of the system architecture may beextracted from the one or more source databases. The operation 526 maybe performed by the fourth information extractor 430 of FIG. 4 or anembodiment of the format converter 120 of FIG. 1. The fourth designdimension may be a function hierarchy. The plurality of fourth instancesmay be a plurality of functions performed by the plurality of parts ofthe system architecture. Some of the functions may be integrations ofothers of the functions, and therefore the functions that areintegrations of others of the functions may be at a higher level of thehierarchy of functions than the others of the functions.

In an operation 528, for each fourth instance of the plurality of fourthinstances, a fourth vertex may be generated in the property graph datamodel. The operation 528 may be performed by the fourth vertex generator432 of FIG. 4 or an embodiment of the graph constructor 140 of FIG. 1.The fourth vertex may represent the fourth instance.

In an operation 530, for one or more fourth instances of the pluralityof fourth instances, a fourth compositional edge may be generated in theproperty graph data model. The operation 530 may be performed by thefourth compositional edge generator 434 of FIG. 4 or an embodiment ofthe graph constructor 140 of FIG. 1. The fourth compositional edge maybe connected to two different fourth vertices. The fourth compositionaledge may represent a hierarchical directed-composition ordirected-decomposition of one fourth instance with respect to anotherfourth instance of the plurality of fourth instances.

In an operation 532, for one or more fourth instances of the pluralityof fourth instances, a fourth connecting edge may be generated in theproperty graph data model. The operation 532 may be performed by thefourth connecting edge generator 436 of FIG. 4 or an embodiment of thegraph constructor 140 of FIG. 1. The fourth connecting edge mayrepresent a connection between the fourth instance and a first instanceof the plurality of first instances, a second instance of the pluralityof second instances, or a third instance of the plurality of thirdinstances. The fourth connecting edge may represent that a functionrepresented by a fourth instance connected to one end of the fourthconnecting edge is connected to a part represented by a first instanceconnected to the other end of the fourth connecting edge, designatingthat the function is performed by the part. The fourth connecting edgemay represent that a function represented by a fourth instance connectedto one end of the fourth connecting edge is connected to an informationitem represented by a third instance connected to the other end of thefourth connecting edge, designating that the information item is inputto the function or the information item is output from the function.

In an operation 534, information pertaining to a plurality of fifthinstances of a fifth design dimension of the system architecture may beextracted from the one or more source databases. The operation 534 maybe performed by the fifth information extractor 438 of FIG. 4 or anembodiment of the format converter 120 of FIG. 1. The fifth designdimension may be a function hierarchy. The plurality of fifth instancesmay be a plurality of requirements based on the plurality of functionsperformed by the plurality of parts of the system architecture. Some ofthe requirements may be integrations of others of the requirements, andtherefore the requirements that are integrations of others of therequirements may be at a higher level of the hierarchy of requirementsthan the others of the requirements.

In an operation 536, for each fifth instance of the plurality of fifthinstances, a fifth vertex may be generated in the property graph datamodel. The operation 536 may be performed by the fifth vertex generator440 of FIG. 4 or an embodiment of the graph constructor 140 of FIG. 1.The fifth vertex may represent the fifth instance.

In an operation 538, for one or more fifth instances of the plurality offifth instances, a fifth compositional edge may be generated in theproperty graph data model. The operation 538 may be performed by thefifth compositional edge generator 442 of FIG. 4 or an embodiment of thegraph constructor 140 of FIG. 1. The fifth compositional edge may beconnected to two different fifth vertices. The fifth compositional edgemay represent a hierarchical directed-composition ordirected-decomposition of one fifth instance with respect to anotherfifth instance of the plurality of fifth instances.

In an operation 540, for one or more fifth instances of the plurality offifth instances, a fifth connecting edge may be generated in theproperty graph data model. The operation 540 may be performed by thefifth connecting edge generator 444 of FIG. 4 or an embodiment of thegraph constructor 140 of FIG. 1. The fifth connecting edge may representa connection between the fifth instance and a first instance of theplurality of first instances, a second instance of the plurality ofsecond instances, a third instance of the plurality of third instances,or a fourth instance of the plurality of fourth instances. The fifthconnecting edge may represent that a requirement represented by a fifthinstance connected to one end of the fifth connecting edge is connectedto a function represented by a fourth instance connected to the otherend of the fifth connecting edge, designating that the function is basedon the requirement. The fifth connecting edge may represent that arequirement represented by a fifth instance connected to one end of thefifth connecting edge is connected to a part represented by a firstinstance connected to the other end of the fifth connecting edge,designating that the part is based on the requirement.

In an operation 542, information pertaining to a plurality of sixthinstances of a sixth design dimension of the system architecture may beextracted from the one or more source databases. The operation 542 maybe performed by the sixth information extractor 446 of FIG. 4 or anembodiment of the format converter 120 of FIG. 1. The sixth designdimension may be a signal hierarchy. The plurality of sixth instancesmay be a plurality of signals communicated via the plurality ofinterfaces between the plurality of parts of the system architecture orcommunicating at least one information item of the plurality ofinformation items of the system architecture. Some of the signals may beintegrations of others of the signals, and therefore the signals thatare integrations of others of the signals may be at a higher level ofthe hierarchy of signals than the others of the signals.

In an operation 544, for each sixth instance of the plurality of sixthinstances, a sixth vertex may be generated in the property graph datamodel. The operation 544 may be performed by the sixth vertex generator448 of FIG. 4 or an embodiment of the graph constructor 140 of FIG. 1.The sixth vertex may represent the sixth instance.

In an operation 546, for one or more sixth instances of the plurality ofsixth instances, a sixth compositional edge may be generated in theproperty graph data model. The operation 546 may be performed by thesixth compositional edge generator 450 of FIG. 4 or an embodiment of thegraph constructor 140 of FIG. 1. The sixth compositional edge may beconnected to two different sixth vertices. The sixth compositional edgemay represent a hierarchical directed-composition ordirected-decomposition of one sixth instance with respect to anothersixth instance of the plurality of sixth instances.

In an operation 548, for one or more sixth instances of the plurality ofsixth instances, a sixth connecting edge may be generated in theproperty graph data model. The operation 548 may be performed by thesixth connecting edge generator 452 of FIG. 4 or an embodiment of thegraph constructor 140 of FIG. 1. The sixth connecting edge may representa connection between the sixth instance and a first instance of theplurality of first instances, a second instance of the plurality ofsecond instances, a third instance of the plurality of third instances,a fourth instance of the plurality of fourth instances, or a fifthinstance of the plurality of fifth instances. The sixth connecting edgemay represent that a signal represented by a sixth edge connected to oneend of the sixth connecting edge is connected to an interfacerepresented by a second instance connected to the other end of the sixthconnecting edge, designating that the signal is included in theinterface. The sixth connecting edge may represent that a signalrepresented by a sixth instance connected to one end of the sixthconnecting edge is connected to an information item represented by athird instance connected to the other end of the sixth connecting edge,designating that the signal is included in the information item.

In various embodiments, there may be any number of different vertextypes representing different design dimensions, and any of the differentvertex types may have connecting edges to any of the other differentvertex types. Any vertex may have one or more connecting edges connectedto it, and each of the one or more connecting edges may connect to anyother vertex of another vertex type within connection rules definedwithin the graph schema 200 (see FIG. 2). Each connecting edgerepresents a relationship between the different vertexes that areconnected by the connecting edge. In some embodiments, the connectingedges are directional. In some embodiments, the connecting edges are notdirectional.

FIGS. 6A and 6B are block diagrams that illustrate generating a weightedpart-to-part, coupling graph based on a property graph, in accordancewith some embodiments. FIG. 6A illustrates an exemplary hierarchicalproperty graph data model 600 of a system architecture similar to theexemplary hierarchical property graph data model 300 illustrated in FIG.3, except that the hierarchical property graph data model 600 does notinclude the functions F, F.1, F.2, the requirements R, R.1, R.2, andtheir associated compositional edges and connecting edges. A newweighted part-to-part coupling graph 610 as illustrated in FIG. 6B maybe generated based on the property graph data model 600 by copying theparts hierarchy of the property graph data model 600 while ignoring anydesign dimensions except for parts and interfaces, and converting theinterfaces of the hierarchical property graph data model 600 intoweighted interface edges between the relevant parts in the weightedpart-to-part coupling graph 610. This may be referred to as a one-modebipartite projection of a two-mode version of the property graph datamodel 600, that contains interface and part vertex classes and theirrespective interface edges, into the weighted part-to-part couplinggraph 610. In some embodiments, the weighted part-to-part coupling graph610 may be generated directly from the source databases 110 of FIG. 1without the intermediate step of creating the property graph data model.For example, the graph constructor 140 of FIG. 1 may directly generatethe weighted part-to-part coupling graph 610.

In an embodiment, the weights of the compositional edges of the weightedpart-to-part coupling graph 610 are set to a value of 1, and the weightsof the interface edges 620, 630 are determined according to thefollowing formula: weight=(1+α)×β, where α is a relative interfacecomplexity factor ranging from 0.0 for minimum complexity to 1.0 formaximum complexity, and β is an architecture importance factor rangingfrom 1.0 for a hardware/software combined architecture and >1.0 for asoftware architecture. The architecture importance factor β may providefor cross-domain scalability (e.g., software vs. hardware design). Forexample, the variable β may represent the importance of informationexchange interfaces relative to a physical decomposition, and therelative complexity factor α may be determined by how many signals aretransferred via an interface represented by the respective interfaceedge. As illustrated, the weight of interface edge 620 is 1, because therelative complexity factor α of the interface between parts A.2 andA.3.1 is 0, and the architecture importance factor β for thishardware/software architecture is 1. The weight of interface edge 630 is2, because the relative complexity factor α of the interface betweenparts A.2 and A.3.1 is 1, and the architecture importance factor β forthis hardware/software architecture is 1.

In an embodiment, a connectivity weighting or graph degree approach maybe used to assign weights to the interface edges representing interfacesbetween parts in the weighted part-to-part coupling graph. Each part mayhave a cost that is divided by the number of compositional and interfaceconnections that it has and that divided cost may be used to determine aweighting of the attached interface edges. In this embodiment, theweights of the interface edges 620, 630 may be determined according tothe following formula: the integration and test cost estimate of thefirst of the pair of parts which the interface edge (e.g., one ofinterface edge 620 or interface edge 630) is coupled with divided by atotal number of edges (all incoming edges, including compositional andinterface edges) connected to the first of the pair of parts plus theintegration and test cost estimate of the second of the pair of partswhich the interface edge (e.g., the other of interface edge 620 orinterface edge 630) is coupled with divided by a total number of edgesconnected to the second of the pair of parts. Each part in the weightedpart-to-part coupling graph 610 may have a cost assigned to it, whichmay be based upon the time required to integrate and test the part orthe number of parts at a lower hierarchical level that integrate intothe part. By this metric, the part A.2 may have a higher cost than thepart A.3.1, for example. The part A.2 has a total of 3 incoming andinterface edges connected to it, whereas the part A.3.1 has just oneinterface edge connected to it. In this embodiment, if the part A.2 wereto be assigned a cost of 3 and the part A.3.1 were to be assigned a costof 1, the weight of the interface edge 620 would be 1, which embodiesthe average cost of integrating the interface. Likewise, if the partA.2.1 were to be assigned a cost of 1 and the part A.3.2 were to beassigned a cost of 1 in this embodiment, the weight of the interfaceedge 630 would be 1.

Various types of computational analyses can be performed based on theweighted part-to-part coupling graph 610. These may include evaluationsof modularity, system architecture internal consistency, robustness, andfragility. For example, by progressively removing interface edges fromthe property graph data model 610, the fragility and robustness of asystem architecture may be determined.

FIG. 7 is a block diagram that illustrates a system 700 for generating aweighted part-to-part coupling graph, in accordance with someembodiments. FIG. 6B illustrates an exemplary weighted part-to-partcoupling graph 610 that may be generated by the system 700. The system700 may include a computing processor 702 and a memory circuit 704 thatmay store a data structure operated on by the computing processor 702,e.g., a data structure based on the graph schema 200 that represents theproperty graph 300. The memory circuit 704 may also store a program thatwhen executed performs the method 800 of FIG. 8. The elements of thesystem. 700 may communicate with one another via one or more connectionsor data buses 722.

A weighted part-to-part coupling graph may be an embodiment of aweighted part-to-part coupling graph data model that includes aplurality of vertices, a plurality of compositional edges, and aplurality of interface edges in a data structure. The plurality ofweighted compositional edges may represent directed-composition anddirected-decomposition within a vertex type, and the plurality ofinterface edges may represent information exchange interfaces betweenvertices. The data structure may be stored in a memory circuit, e.g.,the memory circuit 704, of a computer system having a computingprocessor, e.g., the computing processor 702.

A database parser 706 may access one or more source databases, e.g.,source databases 110 of FIG. 1, including relevant characteristicspertaining to a system architecture. The relevant characteristicspertaining to the system architecture may include information pertainingto the design, modeling, simulation, manufacture, operation, testing,performance, reliability, faults, failure, cost, and evaluation of asystem architecture. The source databases may include data files forvarious hardware and/or software tools for design, modeling, andsimulation of devices, components, subsystems, and systems included inthe system architecture. The source databases may include a datastructure stored in the memory circuit 704, for example, a datastructure including a property graph data model generated according tothe method 500 described with reference to FIG. 5. The database parser706 may include dedicated circuitry or logic that is permanentlyconfigured, e.g., as a special-purpose processor, such as an FPGA or anASIC, or programmable logic or circuitry, e.g., the computing processor702 that performs operations according to instructions stored in thememory circuit 704.

A first information extractor 708 may extract information pertaining toa plurality of first instances of a first design dimension of the systemarchitecture from the one or more source databases. The first designdimension may be a parts hierarchy of the system architecture. The firstinformation extractor 708 may include an embodiment of the firstinformation extractor 408 of FIG. 4, or may be included in an embodimentof the format converter 120 of FIG. 1. The plurality of first instancesmay be a plurality of parts of the system architecture. Some of theparts may be integrations of others of the parts, and therefore theparts that are integrations of others of the parts may be at a higherlevel of the hierarchy of parts than the others of the parts. Examplesof the parts hierarchy may be represented by the part 210 in the graphschema 200 and the parts A, A.1, A.2, A.3, A.1.1, A.1.2. A.2.1, A.2.2,A.3.1, and A.3.2 of FIG. 3. For example, a circuit card part may be anintegration of a plurality of integrated circuit parts and a printedcircuit board on which the plurality of integrated circuit parts aremounted, so the circuit card part would be at a higher level of theparts hierarchy than the plurality of integrated circuit parts and thecircuit board part on which the plurality of integrated circuit partsare mounted. The first information extractor 708 may include dedicatedcircuitry or logic that is permanently configured, e.g., as aspecial-purpose processor, such as an FPGA or an ASIC, or programmablelogic or circuitry, e.g., the computing processor 702 that performsoperations according to instructions stored in the memory circuit 704.

A vertex generator 710 may generate a plurality of vertices in theproperty graph data model. Each of the plurality of vertices mayrepresent one first instance of the plurality of first instances. Eachof the plurality of vertices may represent one part of the plurality ofparts. The vertex generator 710 may be included in an embodiment of thegraph constructor 140 of FIG. 1. The vertex generator 710 may includededicated circuitry or logic that is permanently configured, e.g., as aspecial-purpose processor, such as an FPGA or an ASIC, or programmablelogic or circuitry, e.g., the computing processor 702 that performsoperations according to instructions stored in the memory circuit 704.

A compositional edge generator 712 may generate a plurality of weightedcompositional edges in the part-to-part coupling graph data model. Eachof the plurality of weighted compositional edges may connect a differentpair of vertices of the plurality of vertices. Each of the plurality ofweighted compositional edges may represent a hierarchicaldirected-composition or directed-decomposition of one first instance ofthe plurality of first instances with respect to another first instanceof the plurality of first instances. The compositional edge generator712 may be included in an embodiment of the graph constructor 140 ofFIG. 1. The compositional edge generator 712 may include dedicatedcircuitry or logic that is permanently configured, e.g., as aspecial-purpose processor, such as an FPGA or an ASIC, or programmablelogic or circuitry, e.g., the computing processor 702 that performsoperations according to instructions stored in the memory circuit 704.The plurality of weighted compositional edges may represent physicalintegration of the parts of the parts hierarchy of the systemarchitecture.

A compositional edge weight assigner 714 may assign a compositionalweight value to each of the plurality of weighted compositional edges,for example, representing the complexity and/or cost of integration ofthe lower-level part into the higher-level part. The compositional edgeweight assigner 714 may be included in an embodiment of the graphconstructor 140 of FIG. 1. The compositional edge weight assigner 714may include dedicated circuitry or logic that is permanently configured,e.g., as a special-purpose processor, such as an FPGA or an ASIC, orprogrammable logic or circuitry, e.g., the computing processor 702 thatperforms operations according to instructions stored in the memorycircuit 704. In an embodiment, each of the plurality of weightedcompositional edges may be assigned a weight value of one.

A second information extractor 716 may extract information from the oneor more source databases pertaining to a plurality of second instancesof a second design dimension of the system architecture. The seconddesign dimension may be an interface hierarchy between the plurality ofparts of the system architecture. The second information extractor 716may include an embodiment of the second information extractor 414 ofFIG. 4 or may be included in an embodiment of the format converter 120of FIG. 1. The interface hierarchy may include a plurality of interfacesbetween the plurality of parts of the system architecture. Some of theinterfaces may be integrations of others of the interfaces, andtherefore the interfaces that are integrations of others of theinterfaces may be at a higher level of the hierarchy of interfaces thanthe others of the interfaces. Examples of the hierarchy of interfacesmay be represented by the interface 220 in the graph schema 200 and theinterfaces Z, Z.1, Z.2, and X of FIG. 3. For example, a wiring harnessmay be an integration of a plurality of individual wires, and eachindividual wire may be an integration of a plurality of communicationprotocol connections, e.g., Ethernet connections, so the wiring harnesswould be at a higher level of the interface hierarchy than the pluralityof wires, and each wire would be at a higher level of the interfacehierarchy than the plurality of communication protocol connections,e.g., Ethernet connections. The second information extractor 716 mayinclude dedicated circuitry or logic that is permanently configured,e.g., as a special-purpose processor, such as an FPGA or an ASIC, orprogrammable logic or circuitry, e.g., the computing processor 702 thatperforms operations according to instructions stored in the memorycircuit 704.

An interface edge generator 718 may generate a plurality of weightedinterface edges. Each of the plurality of weighted interface edges mayconnect a different pair of vertices of the plurality of vertices andrepresent an information exchange connection between a correspondingpair of first instances of the plurality of first instances according toone or more second instances of the plurality of second instances. Theplurality of weighted interface edges may represent information exchangeconnections between pairs of parts of the parts hierarchy of the systemarchitecture. The interface edge generator 718 may include dedicatedcircuitry or logic that is permanently configured, e.g., as aspecial-purpose processor, such as an FPGA or an ASIC, or programmablelogic or circuitry, e.g., the computing processor 702 that performsoperations according to instructions stored in the memory circuit 704.

An interface edge weight assigner 720 may assign an interface weight toeach of the plurality of weighted interface edges. In an embodiment, theinterface weight value may be defined by the formula (1+α)×β, where α isa relative interface complexity factor ranging from 0.0 for a minimumcomplexity to 1.0 for a maximum complexity and β is an architectureimportance factor. The factor β may be 1.0 for a hardware/softwarecombined architecture and >1.0, e.g., 3.0, for a software architecture.In an embodiment, an interface weight value for each of the plurality ofweighted interface edges may be defined as a sum of one divided by atotal number of edges connected to a first of the pair of verticesconnected to the corresponding weighted interface edge, multiplied by anintegration and test cost estimate of the first of the pair of vertices,and one divided by a total number of edges connected to a second of thepair of vertices connected to the corresponding weighted interface edge,multiplied by an integration and test cost estimate of a second of thepair of vertices. The integration and test cost estimate of a vertex maybe determined and input by a user based on real-world systemsengineering principles relating to the part represented by the vertex.The interface edge weight assigner 720 may include dedicated circuitryor logic that is permanently configured, e.g., as a special-purposeprocessor, such as an FPGA or an ASIC, or programmable logic orcircuitry, e.g., the computing processor 702 that performs operationsaccording to instructions stored in the memory circuit 704.

FIG. 8 is a block diagram that illustrates a method 800 of generating aweighted part-to-part coupling graph, in accordance with someembodiments. The method 800 may be performed by the system 700 of FIG.7. FIG. 6B illustrates an exemplary weighted part-to-part coupling graph610 that may be generated by the method 800. The weighted part-to-partcoupling graph may be an embodiment of a property graph data model thatincludes a plurality of vertices, a plurality of weighted compositionaledges, and a plurality of weighted interface edges in a data structure.The plurality of weighted compositional edges may representdirected-composition and directed-decomposition within a vertex type,and the plurality of weighted interface edges may represent informationexchange interfaces between vertices. The data structure may be storedin a memory circuit, e.g., the memory circuit 704, of a computer systemhaving a computing processor, e.g., the computing processor 702.

In an operation 802, one or more source databases, such as sourcedatabases 110 of FIG. 1, may be accessed by the computing processor. Theoperation 802 may be performed by the database parser 706 of FIG. 7 oran embodiment of the format converter 120 of FIG. 1. The sourcedatabases may include relevant characteristics pertaining to a systemarchitecture. The relevant characteristics pertaining to the systemarchitecture may include information pertaining to the design, modeling,simulation, manufacture, operation, testing, performance, reliability,faults, failure, cost, and evaluation of a system architecture. Thesource databases may include data files for various hardware and/orsoftware tools for design, modeling, and simulation of devices,components, subsystems, and systems included in the system architecture.The source databases may include a data structure stored in a memorycircuit of the computer system, for example, a data structure includinga property graph data model generated according to the method 500described with reference to FIG. 5.

In an operation 804, information pertaining to a plurality of firstinstances of a first design dimension of the system architecture may beextracted from the one or more source databases. The operation 804 maybe performed by the first information extractor 708 of FIG. 7 or anembodiment of the format converter 120 of FIG. 1. The first designdimension may be a parts hierarchy of the system architecture. Theplurality of first instances may be a plurality of parts of the systemarchitecture. Some of the parts may be integrations of others of theparts, and therefore the parts that are integrations of others of theparts may be at a higher level of the hierarchy of parts than the othersof the parts. Examples of the parts hierarchy may be represented by thepart 210 in the graph schema 200 and the parts A, A.1, A.2, A.3, A.1.1,A.1.2, A.2.1, A.2.2, A.3.1, and A.3.2 of FIG. 3. For example, a circuitcard part may be an integration of a plurality of integrated circuitparts and a printed circuit board on which the plurality of integratedcircuit parts are mounted, so the circuit card part would be at a higherlevel of the parts hierarchy than the plurality of integrated circuitparts and the circuit board part on which the plurality of integratedcircuit parts are mounted.

In an operation 806, a plurality of vertices may be generated. Each ofthe plurality of vertices may represent one first instance of theplurality of first instances. The operation 806 may be performed by thevertex generator 710 of FIG. 7 or an embodiment of the graph constructor140 of FIG. 1.

In an operation 808, a plurality of weighted compositional edges may begenerated. The operation 808 may be performed by the compositional edgegenerator 712 of FIG. 7 or an embodiment of the graph constructor 140 ofFIG. 1. Each of the plurality of weighted compositional edges mayconnect a different pair of vertices of the plurality of vertices andrepresent a hierarchical directed-composition or directed-decompositionof one first instance of the plurality of first instances with respectto another first instance of the plurality of first instances. Theplurality of weighted compositional edges may represent physicalintegration of the parts of the parts hierarchy of the systemarchitecture. The plurality of weighted compositional edges mayrepresent physical integration of parts of the parts hierarchy of thesystem architecture. The plurality of weighted compositional edges mayeach be assigned a compositional weight value, for example, representingthe complexity and/or cost of integration of the lower-level part intothe higher-level part. In an embodiment, each of the plurality ofweighted compositional edges may be assigned a weight value of one.

In an operation 810, information pertaining to a plurality of secondinstances of a second design dimension of the system architecture may beextracted from the one or more source databases. The operation 810 maybe performed by the second information extractor 414 of FIG. 4 or anembodiment of the format converter 120 of FIG. 1. The second designdimension may be an interface hierarchy between the plurality of partsof the system architecture. The plurality of second instances may be aplurality of interfaces between the plurality of parts of the systemarchitecture. Some of the interfaces may be integrations of others ofthe interfaces, and therefore the interfaces that are integrations ofothers of the interfaces may be at a higher level of the hierarchy ofinterfaces than the others of the interfaces. Examples of the hierarchyof interfaces may be represented by the interface 220 in the graphschema 200 and the interfaces Z, Z.1, Z.2, and X of FIG. 3. For example,a wiring harness may be an integration of a plurality of individualwires, and each individual wire may be an integration of a plurality ofcommunication protocol connections, e.g., Ethernet connections, so thewiring harness would be at a higher level of the interface hierarchythan the plurality of wires, and each wire would be at a higher level ofthe interface hierarchy than the plurality of communication protocolconnections, e.g., Ethernet connections.

In an operation 812, a plurality of weighted interface edges may begenerated. Each of the plurality of weighted interface edges may connecta different pair of vertices of the plurality of vertices and representan information exchange connection between a corresponding pair of firstinstances of the plurality of first instances according to one or moresecond instances of the plurality of second instances. The plurality ofweighted interface edges may represent information exchange connectionsbetween pairs of parts of the parts hierarchy of the systemarchitecture.

In an operation 814, an interface weight value may be assigned to eachof the plurality of weighted interface edges. In an embodiment, theinterface weight value may be defined by the formula (1+α)×β, where α isa relative interface complexity factor ranging from 0.0 for a minimumcomplexity to 1.0 for a maximum complexity and β is an architectureimportance factor. The factor β may be 1.0 for a hardware/softwarecombined architecture and >1.0, e.g., 3.0, for a software architecture.In an embodiment, an interface weight value for each of the plurality ofweighted interface edges may be defined as a sum of one divided by atotal number of edges connected to a first of the pair of verticesconnected to the corresponding weighted interface edge, multiplied by anintegration and test cost estimate of the first of the pair of vertices,and one divided by a total number of edges connected to a second of thepair of vertices connected to the corresponding weighted interface edge,multiplied by an integration and test cost estimate of a second of thepair of vertices. The integration and test cost estimate of a vertex maybe determined and input by a user based on real-world systemsengineering principles relating to the part represented by the vertex.

FIG. 9 is a block diagram 900 that illustrates quantifying consistencyof an exemplary system architecture, in accordance with someembodiments. During the design process for a system, the systemarchitecture may be broken down into a hierarchy of parts, and the partsmay be integrated together with information exchange interfaces betweenthem. This is represented by the weighted part-to-part coupling graphdescribed with reference to FIG. 6B. The information exchange interfacesbetween the parts, represented as an interface edge in FIG. 6B (e.g.,interface edges 620 and 630 of FIG. 6B), may introduce coupling betweenthe parts. It is desirable to computationally evaluate the consistencyof the physical coupling of the parts of the system architecture withthe coupling due to the information exchange interfaces based on theweighted part-to-part coupling graph.

A weighted part-to-part coupling graph 910 may be constructed in amanner similar to that described with reference to FIG. 6B. As anexample, the weighted part-to-part coupling graph 910 may represent acomputer system. A physical parts subgraph extraction tool 920 mayperform an extraction of a physical parts subgraph 930 from the weightedpart-to-part coupling graph 910 by copying the weighted part-to-partcoupling graph 910 and removing all edges from the copy exceptcompositional edges that represent hierarchical partscomposition/decomposition. The physical parts subgraph 930 may includethe parts hierarchy of the weighted part-to-part coupling graph 910without the interface edges (e.g., interface edges 620 and 630 of FIG.6B) that represent part-to-part couplings of information exchangeinterfaces. The weightings of the compositional edges may be preservedduring the extraction.

Clustering 940 may be performed on the weighted part-to-part couplinggraph 910 to generate a hierarchical cluster dendrogram 960 of thesystem architecture including both a physical hierarchy of parts andinformation exchange interfaces. Clustering 950 may also be performed onthe physical parts subgraph 930 to generate a hierarchical clusterdendrogram 970 of the system architecture including just the physicalhierarchy of parts without information exchange interfaces. Thehierarchical cluster dendrogram 960 and the hierarchical clusterdendrogram 970 are illustrated graphically as exemplary embodiments, butthese should not be construed as limiting, as various different systemarchitectures may generate different representative hierarchical clusterdendrograms. The hierarchical cluster dendrograms 960 and 970 illustratea plurality of model clusters on their exterior. The hierarchicalcluster dendrograms 960 and 970 may be referred to as either clusters ordendrograms. The clustering 940 and 950 may be performed using variousnetwork or graph-theoretic clustering algorithms, for example, a Newman& Girvan 2004 edge betweenness algorithm. The weightings of thecompositional edges and the interface edges may be used during theclustering 940 and 950.

A correlation of clusters for comparison 980 may be performed onhierarchical clustering dendrograms 960 and 970 to determine aconsistency between the system architecture including just the physicalhierarchy of parts without information exchange interfaces and thesystem architecture including both the physical hierarchy of parts andthe information exchange interfaces. The correlation may be performedusing various network or graph-theoretic correlation algorithms, forexample, a Baker's Gamma correlation 1974 algorithm for comparing howclosely correlated two hierarchical clusters are to one another.Ideally, the consistency would be represented as a value of 1. When theconsistency is not equal to a value of 1, the indication ofinconsistency may be used to determine that additional analyses asdiscussed herein be performed to better understand the source or sourcesof inconsistency in the system architecture from the source databases.For example, the consistency value and subsequent additional analysesmay be used to understand whether the interfaces chosen by a designer orarchitect are consistent with the physical breakdown of the system.Design decisions may be made based on the consistency evaluation.Therefore, the consistency evaluation results of different systemarchitecture design iterations can be plotted in a graph to see how thedesign is progressing either relative to a benchmark design of acompeting product or relative to some prior revision of the design.

FIG. 10 is a graph 1000 that illustrates various exemplary computationanalysis results, in accordance with some embodiments. The x axis of thegraph 1000 represents tune and the y axis of the graph 1000 representsan analysis metric value, with each data point provided for a systemarchitecture design as of the respective date. The graph 1000illustrates how computational analyses can be used to track theevolution of system architecture analysis metric values over time as thesystem architecture design evolves. The dotted line annotated SRR refersto a system requirements review date during a system architecturedevelopment timeline. Plots 1010, 1020, and 1030 represent modularitymetrics.

Modularity metrics can be determined by analyzing the weightedpart-to-part coupling graph using well established network andgraph-theoretic algorithms, for example, the Clauset-Newman-Mooremodularity and community detection algorithms, the Louvain communitydetection algorithm, and the Girvan-Newman algorithm. The part-to-partcoupling graph and the modularity algorithms are well-aligned in termsof how the modularity algorithms operate on the data structure of thepart-to-part coupling graph. In determining the modularity of the systemarchitecture, the analysis determines which communities of parts orseparable group of parts each part is a member of. The algorithms maytake into account both the physical decomposition and how well theinterfaces between the parts are aligned to it. An edge betweennesscluster based on the importance of certain paths, for example, based onhow common certain paths are in the system architecture may be generatedusing the physical breakdown of the system in some embodiments or acombination of physical breakdown and interfaces between parts in otherembodiments, and then a modularity metric may be applied to see howseparable different clusters, or communities, are from one another. Themodularity metric may range from 0 to 1, with 0 being not modular atall, and 1 being ideally modular. It is typically desired that themodularity factor be above 0.3 for a modular system architecture.

The plot 1010 represents modularity of the system architectureconsidering only the physical hierarchy system architecture, and notconsidering the information exchange connections within the systemarchitecture, when observed over time as the architecture evolves duringthe design process. This may also be referred to as the modularity ofthe physical decomposition of the system architecture. The modularity ofthe physical decomposition in plot 1010 may represent how detailed andconsistently broken down the physical parts hierarchy of the systemarchitecture is. The plot 1020 represents an ideal modularity determinedby considering only the logical system architecture, when observed overtime as the architecture evolves during the design process. The plot1020 provides guidance on the best modularity that can be achieved, at agiven point in the evolution of an architecture, given the informationexchange interfaces chosen between parts, with no interface changes andwhen grouping parts into maximum modularity communities or modulesthrough community detection algorithms. The plot 1030 representsmodularity or “separability” of the system architecture, accounting forthe physical parts hierarchy of the system architecture and theinformation exchange interfaces between parts, when observed over timeas the architecture evolves during the design process.

In some embodiments, the risk associated with each interface edge in theweighted part-to-part coupling graph may be determined and plottedaccording to the edge centrality of each interface edge as determined bythe Newman & Girvan 2004 edge betweenness centrality algorithm.Interfaces that are determined to have relatively high centrality arealso considered to have relatively high risk, and may also reducemodularity, which often conflicts with product design goals. Bysimplifying the interfaces to reduce the risk, modularity and therobustness of the system architecture may be improved and thus designgoals may be readily achieved.

One way to identify what interfaces have the greatest impact onmodularity is to determine the modularity of the base weightedpart-to-part coupling graph, and then determine the modularity of eachweighted part-to-part coupling subgraph generated by removing differentinterface edges. The weighted part-to-part coupling subgraph having thegreatest change in modularity from the base weighted part-to-partcoupling graph indicates that modularity of the overall systemarchitecture is the most sensitive to the interface that was removed togenerate that weighted part-to-part coupling subgraph. Likewise, theoverall system architecture is the next-most sensitive to the interfacesremoved to generate the other weighted part-to-part coupling subgraphsthat showed the next greatest change, in rank order. This analysis maybe used to identify interfaces in the system architecture that may havethe greatest impact if simplified or removed to improve the systemmodularity. Without this insight, the wrong areas of the systemarchitecture design may be focused on during design iterations andmodularity may not be improved.

Unlike plots 1010-1030, plot 1040 is not of a modularity metric. Theplot 1040 represents the correlation of the physical decomposition alonewith the combined physical decomposition and information exchangeinterfaces between the parts of the system architecture and thusrepresents the physical to functional alignment of the same, asdescribed with reference to FIG. 9. The plot 1040 illustrates thatbetween datapoints 1040A and 1040B, a design change caused a significantdecrease in the consistency of the system architecture. This metric maybe sensitive to changes in the physical structure of the systemarchitecture, and illustrate when design changes cause the physicaldecomposition of the system to become misaligned with respect to theinformation exchange interfaces or the implicit functional decompositionof the system. A takeaway from the graph 1000 may be that as theconsistency decreases and modularity metrics decrease in value, risksfor the system increase. For example, when internal consistency of thesystem architecture decreases abruptly, then design clarity alsodecreases abruptly. Further, internal consistency can be benchmarkedversus past products to provide insight into whether design claritystandards have been met. Internal clarity and consistency reduceimplementation and interpretation risks throughout a product'slifecycle.

FIG. 11 is a block diagram that illustrates a system 1100 forquantifying consistency of a system architecture, in accordance withsome embodiments. The system 1100 may include a computing processor 1102and a memory circuit 1104 that may store a data structure operated on bythe computing processor 1102. The memory circuit 1104 may also store aprogram that when executed performs the method 1200 of FIG. 12. Thesystem 1100 may compare analyses of property graph data models, e.g.,the property graph data model 150 of FIG. 1, or weighted part-to-partcoupling graph data models, e.g., the weighted part-to-part couplinggraph 610 of FIG. 6B, representing different versions of the systemarchitecture. The elements of the system 1100 may communicate with oneanother via one or more connections or data buses 1124.

The weighted part-to-part coupling graph may be an embodiment of aproperty graph data model that includes a plurality of vertices, aplurality of weighted compositional edges, and a plurality of weightedinterface edges in a data structure. The plurality of weightedcompositional edges may represent directed-composition anddirected-decomposition within a vertex type, and the plurality ofweighted interface edges may represent information exchange interfacesbetween vertices.

A database parser 1106 may access one or more source databases, such assource databases 110 of FIG. 1, including relevant characteristicspertaining to a system architecture. The relevant characteristicspertaining to the system architecture may include information pertainingto the design, modeling, simulation, manufacture, operation, testing,performance, reliability, faults, failure, cost, and evaluation of asystem architecture. The source databases may include data files forvarious hardware and/or software tools for design, modeling, andsimulation of devices, components, subsystems, and systems included inthe system architecture. The source databases may include a datastructure stored in the memory circuit 1104, for example, a datastructure including a property graph data model generated according tothe method 500 described with reference to FIG. 5, or a data structureincluding a weighted part-to-part coupling graph data model generatedaccording to the method 800 described with reference to FIG. 8. Thedatabase parser 1106 may include dedicated circuitry or logic that ispermanently configured, e.g., as a special-purpose processor, such as anFPGA or an ASIC, or programmable logic or circuitry, e.g., the computingprocessor 1102 that performs operations according to instructions storedin the memory circuit 1104.

A first information extractor 1108 may extract information pertaining toa plurality of first instances of a first design dimension of the systemarchitecture from the one or more source databases. The firstinformation extractor 1108 may include an embodiment of the firstinformation extractors 408 of FIG. 4 or 708 of FIG. 7, or may beincluded in an embodiment of the format converter 120 of FIG. 1. Thefirst design dimension may be a parts hierarchy of the systemarchitecture. The plurality of first instances may be a plurality ofparts of the system architecture. Some of the parts may be integrationsof others of the parts, and therefore the parts that are integrations ofothers of the parts may be at a higher level of the hierarchy of partsthan the others of the parts. Examples of the parts hierarchy may berepresented by the part 210 in the graph schema 200 and the parts A,A.1, A.2, A.3, A.1.1, A.1.2, A.2.1, A.2.2, A.3.1, and A.3.2 of FIG. 3.For example, a circuit card part may be an integration of a plurality ofintegrated circuit parts and a printed circuit board on which theplurality of integrated circuit parts are mounted, so the circuit cardpart would be at a higher level of the parts hierarchy than theplurality of integrated circuit parts and the circuit board part onwhich the plurality of integrated circuit parts are mounted. The firstinformation extractor 1108 may include dedicated circuitry or logic thatis permanently configured, e.g., as a special-purpose processor, such asan FPGA or an ASIC, or programmable logic or circuitry, e.g., thecomputing processor 1102 that performs operations according toinstructions stored in the memory circuit 1104.

A second information extractor 1110 may extract information from the oneor more source databases pertaining to a plurality of second instancesof a second design dimension of the system architecture. The seconddesign dimension may be an interface hierarchy between the plurality ofparts of the system architecture. The second information extractor 1110may include an embodiment of the second information extractors 414 ofFIG. 4 or 716 of FIG. 7, or may be included in an embodiment of theformat converter 120 of FIG. 1. The interface hierarchy may include aplurality of interfaces between the plurality of parts of the systemarchitecture. Some of the interfaces may be integrations of others ofthe interfaces, and therefore the interfaces that are integrations ofothers of the interfaces may be at a higher level of the hierarchy ofinterfaces than the others of the interfaces. Examples of the hierarchyof interfaces may be represented by the interface 220 in the graphschema 200 and the interfaces Z, Z.1, Z.2, and X of FIG. 3. For example,a wiring harness may be an integration of a plurality of individualwires, and each individual wire may be an integration of a plurality ofcommunication protocol connections, e.g., Ethernet connections, so thewiring harness would be at a higher level of the interface hierarchythan the plurality of wires, and each wire would be at a higher level ofthe interface hierarchy than the plurality of communication protocolconnections, e.g., Ethernet connections. The second informationextractor 1110 may include dedicated circuitry or logic that ispermanently configured, e.g., as a special-purpose processor, such as anFPGA or an ASIC, or programmable logic or circuitry, e.g., the computingprocessor 1102 that performs operations according to instructions storedin the memory circuit 1104.

A first data structure generator 1112 may generate a first datastructure representing a first weighted property graph data model. Thefirst weighted property graph data model may be an embodiment of theweighted part-to-part coupling graph 910 of FIG. 9 or the weightedpart-to-part coupling graph data model described with reference to FIG.6B. The first data structure may be generated according to an embodimentof the method 800 described with reference to FIG. 8. The first datastructure may include a plurality of first vertices. Each of the firstvertices may represent one first instance of the plurality of firstinstances. The first data structure may also include a plurality offirst weighted compositional edges. Each of the plurality of firstweighted compositional edges may connect a different pair of firstvertices of the plurality of first vertices and represent a hierarchicaldirected-composition or directed-decomposition of one first instance ofthe plurality of first instances with respect to another first instanceof the plurality of first instances. Each of the plurality of firstweighted compositional edges may also be assigned a weight value. Thefirst data structure may include a plurality of first weighted interfaceedges. Each of the plurality of first weighted interface edges mayconnect a different pair of first vertices of the plurality of firstvertices and represent an information exchange interface between acorresponding pair of first instances of the plurality of firstinstances according to one or more second instances of the plurality ofsecond instances. Each of the plurality of first weighted interfaceedges may also be assigned a weight value. The first data structuregenerator 1112 may include dedicated circuitry or logic that ispermanently configured, e.g., as a special-purpose processor, such as anFPGA or an AMC, or programmable logic or circuitry, e.g., the computingprocessor 1102 that performs operations according to instructions storedin the memory circuit 1104.

A second data structure generator 1114 may generate a second datastructure representing a second weighted property graph data model. Thesecond data structure may be an embodiment of the physical partssubgraph 930 of FIG. 9. The second data structure generator 1114 may bean embodiment of the physical parts subgraph extraction tool 920 of FIG.9. The second weighted property graph data model may be an embodiment ofthe physical parts subgraph 930 of FIG. 9 or an embodiment of theweighted part-to-part coupling graph data model 610 described withreference to FIG. 6B. The second data structure may include a pluralityof second vertices. Each of the second vertices may represent one firstinstance of the plurality of first instances. The second data structuremay also include a plurality of second weighted compositional edges.Each of the plurality of second weighted compositional edges may connecta different pair of second vertices of the plurality of second verticesand represent a hierarchical directed-composition ordirected-decomposition of one first instance of the plurality of firstinstances with respect to another first instance of the plurality offirst instances. Each of the plurality of second weighted compositionaledges may be assigned a weight value. The second data structuregenerator 1114 may generate the second data structure by creating a copyof the first data structure and then deleting or removing the weightedinterface edges from the copy of the first data structure. The weightedinterface edges may be ignored when creating the copy of the first datastructure so that they never are created in the copy of the first datastructure. The second data structure may be generated in a similarmanner as the first data structure as described with reference to thefirst data structure generator 1112 except for not generating theplurality of first weighted interface edges. The second data structuregenerator 1114 may include dedicated circuitry or logic that ispermanently configured, e.g., as a special-purpose processor, such as anFPGA or an ASIC, or programmable logic or circuitry, e.g., the computingprocessor 1102 that performs operations according to instructions storedin the memory circuit 1104.

A first cluster generator 1116 may generate a combined compositional andinterface edge betweenness hierarchical cluster dendrogram of the firstdata structure. The first cluster generator 1116 may perform anerribodiment of the clustering 940 of FIG. 9, and the combinedcompositional and interface edge betweenness hierarchical clusterdendrogram may be an embodiment of the hierarchical cluster dendrogram960 of FIG. 9. The combined compositional and interface edge betweennesshierarchical cluster dendrogram may be generated by performing a Newmanand Girvan 2004 computation on the first data structure. The firstcluster generator 1116 may include dedicated circuitry or logic that ispermanently configured, e.g., as a special-purpose processor, such as anFPGA or an ASIC, or programmable logic or circuitry, e.g., the computingprocessor 1102 that performs operations according to instructions storedin the memory circuit 1104.

A second cluster generator 1118 may generate a compositional edgebetweenness hierarchical cluster dendrogram of the second datastructure. The second cluster generator 1118 may perform an embodimentof the clustering 950 of FIG. 9, and the combined compositional andinterface edge betweenness hierarchical cluster dendrogram may be anembodiment of the hierarchical cluster dendrogram 970 of FIG. 9. Thecompositional edge betweenness hierarchical cluster dendrogram may begenerated by performing a Newman and Girvan 2004 computation on thesecond data structure. The second cluster generator 1118 may includededicated circuitry or logic that is permanently configured, e.g., as aspecial-purpose processor, such as an FPGA or an ASIC, or programmablelogic or circuitry, e.g., the computing processor 1102 that performsoperations according to instructions stored in the memory circuit 1104.

A correlation calculator 1120 may calculate a correlation between thecombined compositional and interface edge betweenness hierarchicalcluster dendrogram and the compositional edge betweenness hierarchicalcluster dendrogram. The correlation calculator 1120 may perform anembodiment of the correlation of clusters for comparison 980 of FIG. 9.The correlation may be calculated by performing Baker's Gammacorrelation 1974 computation on the combined compositional and interfaceedge betweenness hierarchical cluster dendrogram and the compositionaledge betweenness hierarchical cluster dendrogram. The correlationcalculator 1120 may include dedicated circuitry or logic that ispermanently configured, e.g., as a special-purpose processor, such as anFPGA or an ASIC, or programmable logic or circuitry, e.g., the computingprocessor 1102 that performs operations according to instructions storedin the memory circuit 1104.

A correlation plotter 1122 may plot the correlation corresponding toeach of a plurality of different system architectures on a common plot,e.g., the plot 1040 of FIG. 10, representing how close the architectureinstances are from one another in terms of physical composition andinterfaces. The different system architectures may be different designiterations at different dates or milestones of a system architecturedevelopment project. The correlation plotter 1122 may include dedicatedcircuitry or logic that is permanently configured, as a special-purposeprocessor, such as an FPGA or an ASIC, or programmable logic orcircuitry, e.g., the computing processor 1102 that performs operationsaccording to instructions stored in the memory circuit 1104.

FIG. 12 is a block diagram that illustrates a method 1200 of quantifyingconsistency of a system architecture, in accordance with someembodiments. The method 1200 may be performed by the system 1100 of FIG.11. The method 1200 may compare analyses of property graph data modelsor weighted part-to-part coupling graph data models representingdifferent versions of the system architecture. The weighted part-to-partcoupling graph may be an embodiment of a property graph data model thatincludes a plurality of vertices, a plurality of weighted compositionaledges, and a plurality of weighted interface edges in a data structure.FIG. 6B illustrates an exemplary weighted part-to-part coupling graph610. The plurality of weighted compositional edges may representdirected-composition and directed-decomposition within a vertex type,and the plurality of weighted interface edges may represent informationexchange interfaces or other interfaces between vertices. The datastructure may be stored in a memory circuit, e.g., the memory circuit1104, of a computer system having a computing processor, e.g., thecomputing processor 1102, and the method 1100 may be performed by thecomputing processor.

In an operation 1202, information may be extracted from one or moresource databases, such as source databases 110 of FIG. 1, includingrelevant characteristics pertaining to a system architecture. Therelevant characteristics pertaining to the system architecture mayinclude information pertaining to the design, modeling, simulation,manufacture, operation, testing, performance, reliability, faults,failure, cost, and evaluation of a system architecture. The operation1202 may be performed by embodiments of the database parser 1106 of FIG.11, the first information extractor 1108 of FIG. 11, the secondinformation extractor 1110 of FIG. 11, and/or the format converter 120of FIG. 1. The source databases may include data files for varioushardware and/or software tools for design, modeling, and simulation ofdevices, components, subsystems, and systems included in the systemarchitecture. The source databases may include a data structure storedin a memory circuit of the computer system, for example, a datastructure including a property graph data model generated according tothe method 500 described with reference to FIG. 5, or a data structureincluding a weighted part-to-part coupling graph data model generatedaccording to the method 800 described with reference to FIG. 8.

The extracted information may pertain to a plurality of first instancesof a first design dimension of the system architecture and a pluralityof second instances of a second design dimension of the systemarchitecture. The first design dimension may be a parts hierarchy of thesystem architecture. The plurality of first instances may be a pluralityof parts of the system architecture. Some of the parts may beintegrations of others of the parts, and therefor the parts that areintegrations of others of the parts may be at a higher level of thehierarchy of parts than the others of the parts. Examples of the partshierarchy may be represented by the part 210 in the graph schema 200 andthe parts A, A.1, A.2, A.3, A.1.1, A.1.2, A.2.1, A.2.2, A.3.1, and A.3.2of FIG. 3. For example, a circuit card part may be an integration of aplurality of integrated circuit parts and a printed circuit board onwhich the plurality of integrated circuit parts are mounted, so thecircuit card part would be at a higher level of the parts hierarchy thanthe plurality of integrated circuit parts and the circuit board part onwhich the plurality of integrated circuit parts are mounted. The seconddesign dimension may be an interface hierarchy between the plurality ofparts of the system architecture. The plurality of second instances maybe a plurality of interfaces between the plurality of parts of thesystem architecture. Some of the interfaces may be integrations ofothers of the interfaces, and therefore the interfaces that areintegrations of others of the interfaces may be at a higher level of thehierarchy of interfaces than the others of the interfaces. Examples ofthe hierarchy of interfaces may be represented by the interface 220 inthe graph schema 200 and the interfaces Z, Z.1, Z.2, and X of FIG. 3.For example, a wiring harness may be an integration of a plurality ofindividual wires, and each individual wire may be an integration of aplurality of communication protocol connections, e.g., Ethernetconnections, so the wiring harness would be at a higher level of theinterface hierarchy than the plurality of wires, and each wire would beat a higher level of the interface hierarchy than the plurality ofcommunication protocol connections, e.g., Ethernet connections.

In an operation 1204, a first data structure representing a firstweighted property graph data model may be generated. The first weightedproperty graph data, model may be an embodiment of the weightedpart-to-part coupling graph 910 of FIG. 9 or the weighted part-to-partcoupling graph data model 610 described with reference to FIG. 6B. Thefirst data structure may be generated according to an embodiment of themethod 800 described with reference to FIG. 8. The first data structuremay include a plurality of first vertices representing the plurality offirst instances, a plurality of first weighted compositional edgesconnecting different pairs of first vertices of the plurality of firstvertices and representing hierarchical directed-compositions ordirected-decompositions of the plurality of first instances, and aplurality of first weighted interface edges connecting different pairsof first vertices of the plurality of first vertices and representinginformation exchange interfaces between the plurality of first instancesaccording to one or more second instances of the plurality of secondinstances. The plurality of first weighted compositional edges mayrepresent physical integration of parts of the parts hierarchy of thesystem architecture. The plurality of first weighted interface edges mayrepresent information exchange interfaces between pairs of parts of theparts hierarchy of the system architecture. Each of the plurality offirst weighted compositional edges and each of the plurality of firstweighted interface edges may be assigned a weight value.

In an operation 1206, a second data structure equivalent to the firstdata structure except not including the plurality of first weightedinterface edges may be generated. The second data structure may be anembodiment of the physical parts subgraph 930 of FIG. 9, and may begenerated using an embodiment of the physical parts subgraph extractiontool 920 of FIG. 9. The second data structure may be generated bycreating a copy of the first data structure and then deleting orremoving the weighted interface edges from the copy of the first datastructure. The weighted interface edges may be ignored when creating thecopy of the first data structure so that they never are created in thecopy of the first data structure. The second data structure may begenerated in a similar manner as the first data structure as describedwith reference to operation 1204 except for not generating the pluralityof first weighted interface edges.

In an operation 1208, a combined compositional and interface edgebetweenness hierarchical cluster dendrogram of the first data structuremay be generated. The operation 1208 may be an embodiment of performingthe clustering 940 of FIG. 9, and the combined compositional andinterface edge betweenness hierarchical cluster dendrogram may be anembodiment of the hierarchical cluster dendrogram 960 of FIG. 9. Thecombined compositional and interface edge betweenness hierarchicalcluster dendrogram may be generated by performing a Newman and Girvan2004 edge betweenness computation on the first data structure.

In an operation 1210, a compositional edge betweenness hierarchicalcluster dendrogram of the second data structure may be generated. Theoperation 1210 may be an embodiment of performing the clustering 950 ofFIG. 9, and the compositional edge betweenness hierarchical clusterdendrogram may be an embodiment of the hierarchical cluster dendrogram970 of FIG. 9. The compositional edge betweenness hierarchical clusterdendrogram may be generated by performing a Newman and Girvan 2004 edgebetweenness computation on the second data structure.

In an operation 1212, a correlation between the combined compositionaland interface edge betweenness hierarchical cluster dendrogram and thecompositional edge betweenness hierarchical cluster dendrogram may becalculated. The operation 1212 may be an embodiment of performing thecorrelation of clusters for comparison 980 of FIG. 9. The correlationmay be calculated by performing Baker's Gamma correlation 1974computation on the combined compositional and interface edge betweennesshierarchical cluster dendrogram and the compositional edge betweennesshierarchical cluster dendrogram.

In an operation 1214, each of the operations 1202 to 1212 may beperformed for a different system architecture, and the correlationscorresponding to each of the different system architectures may beplotted on a common plot, e.g., the plot 1040 of FIG. 10. The differentsystem architectures may be different design iterations at differentdates or milestones of a system architecture development project.

FIG. 13 is a block diagram 1300 that illustrates quantifying robustnessof a system architecture, in accordance with some embodiments. Therobustness of a system architecture design may be computationallyevaluated using a hierarchical part-to-part coupling graph, for example,as illustrated and described with reference to FIG. 6B. For example, therobustness and fragility of the system architecture to disturbances ininformation exchange through the information exchange interfaces can becomputationally evaluated. This provides metrics that can aid designdecisions from an early stage of the system architecture design all theway through the later detailed design stages to improve reliability andmodularity. The metrics from computational analyses of the systemarchitecture design can be utilized to inform and balance trade-offsbetween modularity and robustness.

Previously, robustness evaluations of a system architecture were notperformed computationally. Rather, a reliability expert would beemployed to manually develop a costly reliability model and provide asubjective evaluation of the reliability. The development of thereliability model was largely based on component and piece part failureand mean time between failure data which is often not attainable for newdesigns early enough to have an impact on the architecture. In addition,the component and piece part failure and mean time between failure datadoes not address the functional reliability aspect of thearchitecture—only the physical reliability aspect. Furthermore, thismodel may not take into account all of the information relevant to thesystem architecture due to the reliability expert's translation ofarchitecture to the reliability model. This type of reliability modelwould also require a detailed design, and not an early-stage coarsedesign, which would prevent its usefulness for guiding design iterationsas the system architecture is designed in greater and greater detail,and therefore was not very useful for improving the reliability of earlyconceptual system architectures.

Typical network and graph-theoretic algorithms are also not capable ofevaluating robustness of the system architecture as represented by theweighted part-to-part coupling graph as illustrated in FIG. 6B. This isbecause the part-to-part coupling graph has two types of edges,compositional edges and interface edges. Typical network graphs commonlyused by network and graph-theoretic algorithms have a single class ofedge connecting nodes or vertices and progressively remove edges toevaluate network reliability or robustness based, for example, on thelargest remaining component after edges are removed. Even as theinterface edges in the part-to-part coupling graph described herein maybe individually removed, the compositional edges would remain.Therefore, even if all interface edges are removed, the largestconnected component would remain unchanged (e.g., the complete graph ofall vertices), making typical network and graph-theoretic algorithmsthat evaluate network robustness and reliability inapplicable to theweighted part-to-part coupling graph.

A weighted part-to-part coupling graph 1310 may be constructed in amanner similar to that described with reference to FIG. 6B. As anexample, the weighted part-to-part coupling graph 1310 may represent acomputer system. An interface edge removal tool 1320 may select andremove an interface edge (e.g., interface edges 620 and 630 of FIG. 6B)from the weighted part-to-part coupling graph 1310 and generated aweighted part-to-part coupling subgraph 1330 in its first execution, insubsequent executions, the interface edge removal tool 1320 may removeanother interface edge from the last generated weighted part-to-partcoupling graph 1330 to generate another weighted part-to-part couplinggraph 1330. The interface edge removal tool 1320 may choose an interfaceedge to remove based on a random selection, or based on an analysis ofthe weighted part-to-part coupling graph 1310 or weighted part-to-partcoupling subgraph 1330 from which the interface edge is being removed,e.g., in an order of edge centrality from most central to peripheral.The edge centrality may be determined according to an edge betweennesscentrality algorithm, e.g., Newman & Girvan 2004. The edge removalprobability may be based on an empirical probability distribution of theedge centrality. The interface edges may be removed in an order fromconnections most vulnerable to least vulnerable to attack or change. Theuse of edge centrality to determine the order of interface edge removalmay assume that the attacker has perfect knowledge of the most centralinterfaces in the system architecture, and attacks the interfaces inorder of their centrality. In the case of vulnerability to change,removing central edges first may assume that changes occur as aworst-case scenario.

In an embodiment, each iteration of the interface edge removal tool 1320may remove an interface edge in decreasing quantile order according to agiven quantile sample step size. For example, the interface edge removaltool 1320 may remove an interface edge in decreasing quantile order from1.0 to 0.0 with a quantile sample step size between 0.1 and 0.25, ofedge betweenness centrality. Each weighted part-to-part couplingsubgraph 1330 resulting from this process may have increasing numbers ofremoved interface edges, including one for each quantile sample.

Following the generation of each weighted part-to-part coupling subgraph1330, clustering 1340 may be performed on the generated weightedpart-to-part coupling subgraph 1330 to generate a hierarchical clusterdendrogram 1350 of the system architecture corresponding to therespective generated weighted part-to-part coupling subgraph 1330. Theclustering 1340 may be performed using various network orgraph-theoretic clustering algorithms that account for edge weight, forexample, a Newman & Girvan 2004 edge betweenness algorithm. Theweightings of the compositional edges and the interface edges may beused during the hierarchical clustering 1340. A determination 1360 maybe made regarding whether more interface edges need to be removed fromthe latest hierarchical cluster dendrogram 1350. The number of interfaceedges to be removed may be predetermined ahead of time, for example, bya user, or by a percentage of total number of interface edges in theweighted part-to-part coupling graph 1310. The number of interface edgesto remove may be a majority of the interface edges in the weightedpart-to-part coupling graph 1310. If there are more interface edges toremove, then an interface edge removal 1320 is performed again togenerate another weighted part-to-part coupling subgraph 1330 having oneless interface edge than the prior generated weighted part-to-partcoupling subgraph 1330. Through the interface edge removal 1320 toclustering 1340 loop, a plurality of hierarchical cluster dendrograms1350 may be generated, one for each subsequent edge removal from theweighted part-to-part coupling subgraph 1330.

Clustering 1370 may also be performed on the weighted part-to-partcoupling graph 1310 to generate a baseline hierarchical clusterdendrogram 1380 of the system architecture including all of theinterface edges. The clustering 1370 may be performed using variousnetwork or graph-theoretic clustering algorithms, for example, a Newman& Girvan 2004 edge betweenness algorithm. The weightings of thecompositional edges and the interface edges may be used during theclustering 1370 to generate the baseline hierarchical cluster dendrogram1380.

A correlation of clusters for comparison 1390 may be performed on all ofthe hierarchical cluster dendrograms 1350 in relation to the baselinehierarchical cluster dendrogram 1380, and a plot of correlation results1395 may be generated, showing the correlation results vs. the number ofinterface edges removed from the weighted part-to-part coupling graph1310. The plot of correlation results 1395 may have a number of removedinterface edges as its x axis, or a probability of each interface edgeremoval as its x axis, and the correlation result value as its y axis.The correlation may be performed using various network orgraph-theoretic correlation algorithms, for example, a Baker's Gammacorrelation 1974 algorithm.

The plotted correlation results 1395 may provide a metric of resiliencyor robustness of the system architecture. An embodiment of the plottedcorrelation results 1395 may include the resiliency profile graph 1600of FIG. 16. An overall robustness metric may be determined by comparingthe median of Gamma correlation when probability of edge removal p≥0.5(robustness factor, high damage probability or broad attack) with thesame quantity computed when probability of edge removal p<0.5 (fragilityfactor, low damage probability or narrow attack). The robustness metricmay be determined as the median Gamma correlation when 50% or more ofthe interface edges are removed, and the fragility metric may bedetermined as one minus the median Gamma correlation when less than 50%of the interface edges are removed. A system architecture may beconsidered fragile when there is a statistically significant drop in theplotted correlation value after only a few edges have been removed,whereas in a relatively robust system architecture, the plottedcorrelation value should not drop significantly until a majority ofinterface edges have been removed. For example, statistical significancemay be exemplified by a reduction of functionality after a removal ofedges to a value less than a threshold percentage of a highest level offunctionality without removal of edges. In various embodiments, thethreshold for statistical significance may be 75%, representing areduction of Gamma to less than 0.75, for example, as illustrated in they axis of FIG. 16.

When the interface edge removal tool 1320 uses random selection of aninterface edge to remove, the entire quantification of robustnessprocess from the weighted part-to-part coupling graph 1310 to thecorrelation of clusters for comparison 1390 may be repeated many times(e.g., 100 times) with different random selections made in the interfaceedge removal tool 1320, and the plot of correlation results 1395 mayaverage the correlation results or find the median of the correlationresults and plot them vs. probability of an edge removal. When theanalysis is performed both with random interface edge removal and withtargeted interface edge removal based on edge betweeness centrality(e.g., the interface edges' relative importance in the design of thesystem architecture), two robustness metrics may result: one due torandom selection of interface edges to be removed, and one due totargeted attack on an interface. Both of the robustness metrics relateto functional degradation of the system. The former may be attributed torandom failure due to manufacturing variation or producibility, and thelatter may be due to malicious attack on an interface by an attackerwith perfect knowledge of the vulnerabilities within a design.

Design decisions may be made based on the plotted correlation results1395 and/or the overall robustness metric. The plot of robustness of thesystem architecture showing correlation results after having increasingnumbers of interface edges removed illustrates how many damagedinterfaces the system architecture can tolerate before it becomesignificantly uncorrelated from the original system architecture. As thedesign progresses, each design iteration may be evaluated forquantifying robustness, and the resulting results plots may be comparedto one another. More robust system architectures would tend to havehigher correlation results for more removed interface edges than lessrobust system architectures. The quantifying of robustness may alsoprovide for analysis of functional degradation without developing aseparate model for that purpose.

FIG. 14 is a block diagram that illustrates a system 1400 forquantifying robustness of a system architecture, in accordance with someembodiments. The system 1400 may include a computing processor 1402 anda memory circuit 1404 that may store data structures operated on by thecomputing processor 1402. The memory circuit 1404 may also store aprogram that when executed performs the method 1500 of FIG. 15. Theelements of the system 1400 may communicate with one another via one ormore connections or data buses 1426.

The system 1400 may compare analyses of a first weighted part-to-partcoupling graph data model, e.g., the weighted part-to-part couplinggraph 610 of FIG. 6B, representing a system architecture with a secondweighted part-to-part coupling graph data model equivalent to the firstweighted part-to-part coupling graph data model except for having one ormore information exchange interfaces removed to determine how robust thesystem architecture is to damage resulting from lost informationexchange interfaces. The weighted part-to-part coupling graphs may beembodiments of a property graph data model that includes a plurality ofvertices, a plurality of weighted compositional edges, and a pluralityof weighted interface edges in a data structure. The plurality ofweighted compositional edges may represent directed-composition anddirected-decomposition within a vertex type, and the plurality ofweighted interface edges may represent information exchange interfacesbetween vertices.

A database parser 1406 may access one or more source databases, such assource databases 110 of FIG. 1, including relevant characteristicspertaining to a system architecture. The relevant characteristicspertaining to the system architecture may include information pertainingto the design, modeling, simulation, manufacture, operation, testing,performance, reliability, faults, failure, cost, and evaluation of asystem architecture. The source databases may include data files forvarious hardware and/or software tools for design, modeling, andsimulation of devices, components, subsystems, and systems included inthe system architecture. The source databases may include a datastructure stored in the memory circuit 1404, for example, a datastructure including a property graph data model generated according tothe method 500 described with reference to FIG. 5, or a data structureincluding a weighted part-to-part coupling graph data model generatedaccording to the method 800 described with reference to FIG. 8. Thedatabase parser 1406 may include dedicated circuitry or logic that ispermanently configured, e.g., as a special-purpose processor, such as anFPGA or an ASIC, or programmable logic or circuitry, e.g., the computingprocessor 1402 that performs operations according to instructions storedin the memory circuit 1404.

A first information extractor 1408 may extract information pertaining toa plurality of first instances of a first design dimension of the systemarchitecture from the one or more source databases. The firstinformation extractor 1408 may include an embodiment of the firstinformation extractors 408 of FIG. 4, 708 of FIG. 7, or 1108 of FIG. 11,or may be included in an embodiment of the format converter 120 ofFIG. 1. The first design dimension may be a parts hierarchy of thesystem architecture. The plurality of first instances may be a pluralityof parts of the system architecture. Some of the parts may beintegrations of others of the parts, and therefore the parts that areintegrations of others of the parts may be at a higher level of thehierarchy of parts than the others of the parts. Examples of the partshierarchy may be represented by the part 210 in the graph schema 200 andthe parts A, A.1, A.2, A.3, A.1.1, A.1.2, A.2.1, A.2.2, A.3.1, and A.3.2of FIG. 3. For example, a circuit card part may be an integration of aplurality of integrated circuit parts and a printed circuit board onwhich the plurality of integrated circuit parts are mounted, so thecircuit card part would be at a higher level of the parts hierarchy thanthe plurality of integrated circuit parts and the circuit board part onwhich the plurality of integrated circuit parts are mounted. The firstinformation extractor 1408 may include dedicated circuitry or logic thatis permanently configured, e.g., as a special-purpose processor, such asan FPGA or an ASIC, or programmable logic or circuitry, e.g., thecomputing processor 1402 that performs operations according toinstructions stored in the memory circuit 1404.

A second information extractor 1410 may extract information from the oneor more source databases pertaining to a plurality of second instancesof a second design dimension of the system architecture. The seconddesign dimension may be an interface hierarchy between the plurality ofparts of the system architecture. The second information extractor 1410may include an embodiment of the second information extractors 414 ofFIG. 4, 716 of FIG. 7, or 1110 of FIG. 11, or may be included in anembodiment of the format converter 120 of FIG. 1. The interfacehierarchy may include a plurality of interfaces between the plurality ofparts of the system architecture. Some of the interfaces may beintegrations of others of the interfaces, and therefore the interfacesthat are integrations of others of the interfaces may be at a higherlevel of the hierarchy of interfaces than the others of the interfaces.Examples of the hierarchy of interfaces may be represented by theinterface 220 in the graph schema 200 and the interfaces Z, Z.1, Z.2,and X of FIG. 3. For example, a wiring harness may be an integration ofa plurality of individual wires, and each individual wire may be anintegration of a plurality of communication protocol connections, e.g.,Ethernet connections, so the wiring harness would be at a higher levelof the interface hierarchy than the plurality of wires, and each wirewould be at a higher level of the interface hierarchy than the pluralityof communication protocol connections, e.g., Ethernet connections. Thesecond information extractor 1410 may include dedicated circuitry orlogic that is permanently configured, e.g., as a special-purposeprocessor, such as an FPGA or an ASIC, or programmable logic orcircuitry, e.g., the computing processor 1402 that performs operationsaccording to instructions stored in the memory circuit 1404.

A first data structure generator 1412 may generate a first datastructure representing a first weighted property graph data model. Thefirst weighted property graph data model may be an embodiment of theweighted part-to-part coupling graph 1310 of FIG. 13 or the weightedpart-to-part coupling graph data model 610 described with reference toFIG. 6B. The first data structure may be generated according to anembodiment of the method 800 described with reference to FIG. 8. Thefirst data structure may include a plurality of first vertices. Each ofthe first vertices may represent one first instance of the plurality offirst instances. The first data structure may also include a pluralityof first weighted compositional edges. Each of the plurality of firstweighted compositional edges may connect a different pair of firstvertices of the plurality of first vertices and represent a hierarchicaldirected-composition or directed-decomposition of one first instance ofthe plurality of first instances with respect to another first instanceof the plurality of first instances. Each of the plurality of firstweighted compositional edges may also be assigned a weight value. Thefirst data structure may include a plurality of first weighted interfaceedges. Each of the plurality of first weighted interface edges mayconnect a different pair of first vertices of the plurality of firstvertices and represent an information exchange interface between acorresponding pair of first instances of the plurality of firstinstances according to one or more second instances of the plurality ofsecond instances. Each of the plurality of first weighted compositionaledges and each of the plurality of first weighted interface edges may beassigned a weight value. The first data structure generator 1412 mayinclude dedicated circuitry or logic that is permanently configured,e.g., as a special-purpose processor, such as an FPGA or an ASIC, orprogrammable logic or circuitry, e.g., the computing processor 1402 thatperforms operations according to instructions stored in the memorycircuit 1404.

A second data structure generator 1414 may generate a second datastructure representing a second weighted property graph data model. Thesecond data structure may be equivalent to the first data structureexcept not including one or more of the first weighted interface edges.The second data structure may be an embodiment of the weightedpart-to-part coupling subgraphs 1330 of FIG. 13. The second datastructure generator 1414 may be an embodiment of the connecting edgeremoval 1320 of FIG. 13. The second weighted property graph data modelmay be an embodiment of the weighted part-to-part coupling graph datamodel 610 described with reference to FIG. 6B. The second data structuremay be generated by creating a copy of the first data structure and thendeleting or removing the one or inure weighted interface edges from thecopy of the first data structure. The one or more weighted interfaceedges may be ignored when creating the copy of the first data structureso that they never are created in the copy of the first data structure.The second data structure may be generated in a similar manner as thefirst data structure as described with reference to the first datastructure generator 1412 except for not generating the one or more firstweighted interface edges.

In an embodiment, generating the second data structure includesgenerating a plurality of second data structures, each of the pluralityof second data structures having a different number of weightedinterface edges removed compared to the first data structure. As such,each of the plurality of second data structures may be a differentversion of the first data structure. There may be a number of seconddata structures up to a number of the plurality of weighted interfaceedges in the first data structure. From the first to the last of theplurality of second data structures, an additional weighted interfaceedge may be removed relative to the first data structure in decreasingquantile order, according to a given quantile sample step size of edgebetweenness centrality resulting in a plurality of versions of the firstdata structure having increasing numbers of removed weighted interfaceedges, including one for each quantile sample. For example, the quantileorder may be decreased from 1.0 to 0.0 with a quantile sample step sizebetween 0.1 and 0.25, of edge betweenness centrality. The resultingplurality of second data structures may be versions of the first datastructure having increasing numbers of removed weighted interface edges,including one for each quantile sample. The second data structuregenerator 1414 may include dedicated circuitry or logic that ispermanently configured, e.g., as a special-purpose processor, such as anFPGA or an ASIC, or programmable logic or circuitry, e.g., the computingprocessor 1402 that performs operations according to instructions storedin the memory circuit 1404.

A first cluster generator 1416 may generate a first edge betweennesshierarchical cluster dendrogram of the first data structure. The firstcluster generator 1416 may be an embodiment of the first clustergenerator 1116 of FIG. 11. The first cluster generator 1416 may performan embodiment of the clustering 1370 of FIG. 13, and the first edgebetweenness hierarchical cluster dendrogram may be an embodiment of thebaseline hierarchical cluster dendrogram 1380 of FIG. 13. The first edgebetweenness hierarchical cluster dendrogram may be generated byperforming a Newman and Girvan 2004 edge betweenness computation on thefirst data structure. The first cluster generator 1416 may includededicated circuitry or logic that is permanently configured, e.g., as aspecial-purpose processor, such as an FPGA or an ASIC, or programmablelogic or circuitry, e.g., the computing processor 1402 that performsoperations according to instructions stored in the memory circuit 1404.

A second cluster generator 1418 may generate a second edge betweennesshierarchical cluster dendrogram of the second data structure. The secondcluster generator 1418 may be an embodiment of the second clustergenerator 1118 of FIG. 11. The second cluster generator 1418 may performan embodiment of the clustering 1340 of FIG. 13, and the second edgebetweenness hierarchical cluster dendrogram may be an embodiment of thehierarchical cluster dendrograms 1350 of FIG. 13. The second edgebetweenness hierarchical cluster dendrogram may be generated byperforming a Newman and Girvan 2004 edge betweenness computation on thesecond data structure. A plurality of second edge betweennesshierarchical cluster dendrograms may be generated, with each of theplurality of second edge betweenness hierarchical cluster dendrogramsbeing of a corresponding one of the plurality of second data structuresgenerated by the second data structure generator 1414. The secondcluster generator 1418 may include dedicated circuitry or logic that ispermanently configured, e.g., as a special-purpose processor, such as anFPGA or an ASIC, or programmable logic or circuitry, e.g., the computingprocessor 1402 that performs operations according to instructions storedin the memory circuit 1404.

A correlation calculator 1420 may calculate a correlation between thefirst edge betweenness hierarchical cluster dendrogram and the secondedge betweenness hierarchical cluster dendrogram. The correlationcalculator 1420 may perform an embodiment of the correlation of clustersfor comparison 1390 of FIG. 13. The correlation may be calculated byperforming Baker's Gamma correlation 1974 computation on the first edgebetweenness hierarchical cluster dendrogram and the second edgebetweenness hierarchical cluster dendrogram. A plurality of correlationsmay be calculated between the first edge betweenness hierarchicalcluster dendrogram and corresponding ones of the plurality of secondedge betweenness hierarchical cluster dendrograms. The second clustergenerator 1418 may include dedicated circuitry or logic that ispermanently configured, e.g., as a special-purpose processor, such as anFPGA or an ASIC, or programmable logic or circuitry, e.g., the computingprocessor 1402 that performs operations according to instructions storedin the memory circuit 1404.

A correlation plotter 1422 may plot the plurality of correlationscorresponding to each of the plurality of second data structuresaccording to a number of removed weighted interface edges on a commonplot. The correlation plotter 1422 may produce an embodiment of the plotof correlation results 1395 of FIG. 13, for example, an embodiment ofthe resiliency profile graph 1600 of FIG. 16. The plot of the pluralityof correlations may represent a resiliency profile of the systemarchitecture. The correlation plotter 1422 may include dedicatedcircuitry or logic that is permanently configured, e.g., as aspecial-purpose processor, such as an FPGA or an ASIC, or programmablelogic or circuitry, e.g., the computing processor 1402 that performsoperations according to instructions stored in the memory circuit 1404.

A robustness metric calculator 1424 may calculate a robustness of thesystem architecture represented by the one or more source databases tobroad and narrow attack according to the plurality of correlations foreach of the plurality of second data structures. A robustness to narrowattack may be calculated by a median correlation between the first edgebetweenness hierarchical cluster dendrogram and the second edgebetweenness hierarchical cluster dendrogram for the plurality of seconddata structures with an edge betweeness quantile<0.5. A robustness tobroad attack may be calculated by the median correlation between thefirst edge betweenness hierarchical cluster dendrogram and the secondedge betweenness hierarchical cluster dendrogram for the plurality ofsecond data structures where each removed edge has an edge betweennesscentrality quantile greater than a threshold value, e.g., ≥0.5. Therobustness metric calculator 1424 may include dedicated circuitry orlogic that is permanently configured, e.g., as a special-purposeprocessor, such as an FPGA or an ASIC, or programmable logic orcircuitry, e.g., the computing processor 1402 that performs operationsaccording to instructions stored in the memory circuit 1404.

FIG. 15 is a block diagram that illustrates a method 1500 of quantifyingrobustness of a system architecture, in accordance with someembodiments. The method 1500 may be performed by the system 1400 of FIG.14. The method 1500 may compare analyses of a first weightedpart-to-part coupling graph data model representing a systemarchitecture with a second weighted part-to-part coupling graph datamodel equivalent to the first weighted part-to-part coupling graph datamodel except for having or one more information exchange interfacesremoved to determine how robust the system architecture is to damageresulting in lost information exchange interfaces. The weightedpart-to-part coupling graphs may be embodiments of a property graph datamodel that include a plurality of vertices, a plurality of weightedcompositional edges, and a plurality of weighted interface edges in adata structure. FIG. 6B illustrates an exemplary weighted part-to-partcoupling graph 610. The plurality of weighted compositional edges mayrepresent directed-composition and directed-decomposition within avertex type, and the plurality of weighted interface edges may representinformation exchange interfaces or other interfaces between vertices.The data structures may be stored in a memory circuit, e.g., the memorycircuit 1404, of a computer system having a computing processor, e.g.,the computing processor 1402, and the method 1500 may be performed bythe computing processor.

In an operation 1502, information may be extracted from one or moresource databases, such as source databases 110 of FIG. 1, includingrelevant characteristics pertaining to a system architecture. Therelevant characteristics pertaining to the system architecture mayinclude information pertaining to the design, modeling, simulation,manufacture, operation, testing, performance, reliability, faults,failure, cost, and evaluation of a system architecture. The operation1502 may be performed by embodiments of the database parser 1406 of FIG.14, the first information extractor 1408 of FIG. 14, the secondinformation extractor 1410 of FIG. 14, and/or the format converter 120of FIG. 1. The source databases may include data files for varioushardware and/or software tools for design, modeling, and simulation ofdevices, components, subsystems, and systems included in the systemarchitecture. The source databases may include a data structure storedin a memory circuit of the computer system, for example, a datastructure including a property graph data model generated according tothe method 500 described with reference to FIG. 5, or a data structureincluding a weighted part-to-part coupling graph data model generatedaccording to the method 800 described with reference to FIG. 8.

The extracted information may pertain to a plurality of first instancesof a first design dimension of the system architecture and a pluralityof second instances of a second design dimension of the systemarchitecture. The first design dimension may be a parts hierarchy of thesystem architecture. The plurality of first instances may be a pluralityof parts of the system architecture. Some of the parts may beintegrations of others of the parts, and therefore the parts that areintegrations of others of the parts may be at a higher level of thehierarchy of parts than the others of the parts. Examples of the partshierarchy may be represented by the part 210 in the graph schema 200 andthe parts A, A.1, A.2, A.3, A.1.1, A.1.2, A.2.1, A.2.2, A.3.1, and A.3.2of FIG. 3. For example, a circuit card part may be an integration of aplurality of integrated circuit parts and a printed circuit board onwhich the plurality of integrated circuit parts are mounted, so thecircuit card part would be at a higher level of the parts hierarchy thanthe plurality of integrated circuit parts and the circuit board part onwhich the plurality of integrated circuit parts are mounted. The seconddesign dimension may be an interface hierarchy between the plurality ofparts of the system architecture. The plurality of second instances maybe a plurality of interfaces between the plurality of parts of thesystem architecture. Some of the interfaces may be integrations ofothers of the interfaces, and therefore the interfaces that areintegrations of others of the interfaces may be at a higher level of thehierarchy of interfaces than the others of the interfaces. Examples ofthe hierarchy of interfaces may be represented by the interface 220 inthe graph schema 200 and the interfaces Z, Z.1, Z.2, and X. of FIG. 3.For example, a wiring harness may be an integration of a plurality ofindividual wires, and each individual wire may be an integration of aplurality of communication protocol connections, e.g., Ethernetconnections, so the wiring harness would be at a higher level of theinterface hierarchy than the plurality of wires, and each wire would beat a higher level of the interface hierarchy than the plurality ofcommunication protocol connections, e.g., Ethernet connections.

In an operation 1504, a first data structure representing a firstweighted property graph data model may be generated. The first weightedproperty graph data model may be an embodiment of the weightedpart-to-part coupling graph 1310 of FIG. 13 or the weighted part-to-partcoupling graph data model 610 described with reference to FIG. 6B. Theoperation 1504 may be performed by an embodiment of the first datastructure generator 1412 of FIG. 14. The first data structure may begenerated according to an embodiment of the method 800 described withreference to FIG. 8. The first data structure may include a plurality offirst vertices representing the plurality of first instances, aplurality of first weighted compositional edges connecting differentpairs of first vertices of the plurality of first vertices andrepresenting hierarchical directed-compositions ordirected-decompositions of the plurality of first instances, and aplurality of first weighted interface edges connecting different pairsof first vertices of the plurality of first vertices and representinginformation exchange interfaces between the plurality of first instancesaccording to one or more second instances of the plurality of secondinstances. The plurality of first weighted compositional edges mayrepresent physical integration of parts of the parts hierarchy of thesystem architecture. The plurality of first weighted interface edges mayrepresent logical information exchange interfaces between pairs of partsof the parts hierarchy of the system architecture. Each of the pluralityof first weighted compositional edges and each of the plurality of firstweighted interface edges may be assigned a weight value.

In an operation 1506, a second data structure representing a secondweighted property graph data model may be generated. The second datastructure may be equivalent to the first data structure except notincluding one or more of the first weighted interface edges. The seconddata structure may be an embodiment of the weighted part-to-partcoupling subgraphs 1330 of FIG. 13, and may be generated using anembodiment of the connecting edge removal 1320 of FIG. 13. The operation1506 may be performed by an embodiment of the second data structuregenerator 1414 of FIG. 14. The second weighted property graph data modelmay be an embodiment of the weighted part-to-part coupling graph datamodel 610 described with reference to FIG. 6B. The second data structuremay be generated by creating a copy of the first data structure and thendeleting or removing the one or more weighted interface edges from thecopy of the first data structure. The one or more weighted interfaceedges may be ignored when creating the copy of the first data structureso that they never are created in the copy of the first data structure.The second data structure may be generated in a similar manner as thefirst data structure as described with reference to operation 1504except for not generating the one or more first weighted interfaceedges.

In an embodiment, generating the second data structure includesgenerating a plurality of second data structures, each of the pluralityof second data structures having a different number of weightedinterface edges removed compared to the first data structure. As such,each of the plurality of second data structures may be a differentversion of the first data structure. There may be a number of seconddata structures up to a number of the plurality of weighted interfaceedges in the first data structure. From the first to the last of theplurality of second data structures, an additional weighted interfaceedge may be removed relative to the first data structure in decreasingquantile order, according to a given quantile sample step size of edgebetweenness centrality resulting in a plurality of versions of the firstdata structure having increasing numbers of removed weighted interfaceedges, including one for each quantile sample. For example, the quantileorder may be decreased from 1.0 to 0.0 with a quantile sample step sizebetween 0.1 and 0.25, of edge betweenness centrality. The resultingplurality of second data structures may be versions of the first datastructure having increasing numbers of removed weighted interface edges,including one for each quantile sample.

In an operation 1508, a first edge betweenness hierarchical clusterdendrogram of the first data structure may be generated. The operation1508 may be an embodiment of performing the clustering 1370 of FIG. 13,and the first edge betweenness hierarchical cluster dendrogram may be anembodiment of the baseline hierarchical cluster dendrogram 1380 of FIG.13. The operation 1508 may be performed by an embodiment of the firstcluster generator 1416 of FIG. 14. The first edge betweennesshierarchical cluster dendrogram may be generated by performing a Newmanand Girvan 2004 edge betweenness computation on the first datastructure.

In an operation 1510, a second edge betweenness hierarchical clusterdendrogram of the second data structure may be generated. The operation1510 may be an embodiment of performing the clustering 1340 of FIG. 13,and the second edge betweenness hierarchical cluster dendrogram may bean embodiment of the hierarchical cluster dendrograms 1350 of FIG. 13.The operation 1510 may be performed by an embodiment of the secondcluster generator 1418 of FIG. 14. The second edge betweennesshierarchical cluster dendrogram may be generated by performing a Newmanand Girvan 2004 edge betweenness computation on the second datastructure. A plurality of second edge betweenness hierarchical clusterdendrograms may be generated, with each of the plurality of second edgebetweenness hierarchical cluster dendrograms being of a correspondingone of the plurality of second data structures generated in operation1506.

In an operation 1512, a correlation between the first edge betweennesshierarchical cluster dendrogram and the second edge betweennesshierarchical cluster dendrogram may be calculated. The operation 1512may be an embodiment of performing the correlation of clusters forcomparison 1390 of FIG. 13. The operation 1512 may be performed by anembodiment of the correlation calculator 1410 of FIG. 14. Thecorrelation may be calculated by performing Baker's Gamma correlation1974 computation on the first edge betweenness hierarchical clusterdendrogram and the second edge betweenness hierarchical clusterdendrogram. A plurality of correlations may be calculated between thefirst edge betweenness hierarchical cluster dendrogram and correspondingones of the plurality of second edge betweenness hierarchical clusterdendrograms.

In an operation 1514, a robustness to narrow attack may be calculated bya median correlation between the first edge betweenness hierarchicalcluster dendrogram and the second edge betweenness hierarchical clusterdendrogram for the plurality of second data structures with an edgebetweeness centrality quantile<0.5.

In an operation 1516, a robustness to broad attack may be calculated bythe median correlation between the first edge betweenness hierarchicalcluster dendrogram and the second edge betweenness hierarchical clusterdendrogram for the plurality of second data structures where eachremoved edge has an edge betweenness centrality quantile greater than athreshold value, e.g., ≥0.5.

In an operation 1518, a plot of the plurality of correlationscorresponding to each of the plurality of second data structuresaccording to a number of removed weighted interface edges may be output.The operation 1518 may be performed by an embodiment of the correlationplotter 1422. The plot of the plurality of correlations may represent aresiliency profile of the system architecture. The operation 1518 mayproduce an embodiment of the resiliency profile graph 1600 of FIG. 16.

FIG. 16 is a resiliency profile graph 1600 that illustrates a resiliencyprofile 1600, 1610 of a few different iterations of a systemarchitecture design, in accordance with some embodiments. The resiliencyprofile graph 1600 may be produced by operation 1518 of the method 1500,described with reference to FIG. 15. The resiliency profile 1610 mayrepresent a system architecture design iteration that is robust,indicated by the retained functionality not dropping significantly untilafter 50% of the breadth of targeted attack is reached. In contrast, theresiliency profile 1620 may represent a system architecture designiteration that is fragile, indicated by the retained functionalitydropping significantly before 50% of the breadth of targeted attack isreached. As illustrated, the retained functionality of the systemarchitecture design iteration corresponding to the resiliency profile1620 drops significantly after about 10% of the breadth of targetedattack is reached.

Modules, Components and Logic

Certain embodiments are described herein as including logic or a numberof components, modules, or mechanisms. Modules may constitute eithersoftware modules (e.g., code embodied (1) on a non-transitorymachine-readable medium or (2) in a transmission signal) orhardware-implemented modules. A hardware-implemented module is tangibleunit capable of performing certain operations and may be configured orarranged in a certain manner. In example embodiments, one or morecomputer systems (e.g., a standalone, client or server computer system)or one or more processors may be configured by software (e.g., anapplication or application portion) as a hardware-implemented modulethat operates to perform certain operations as described herein.

In various embodiments, a hardware-implemented module may be implementedmechanically or electronically. For example, a hardware-implementedmodule may comprise dedicated circuitry or logic that is permanentlyconfigured (e.g., as a special-purpose processor, such as an FPGA or anASIC) to perform certain operations. A hardware-implemented module mayalso comprise programmable logic or circuitry (e.g., as encompassedwithin a general-purpose processor or other programmable processor) thatis temporarily configured by software to perform certain operations. Itwill be appreciated that the decision to implement ahardware-implemented module mechanically, in dedicated and permanentlyconfigured circuitry, or in temporarily configured circuitry (e.g.,configured by software) may be driven by cost and time considerations.

Accordingly, the term “hardware-implemented module” should be understoodto encompass a tangible entity, be that an entity that is physicallyconstructed, permanently configured (e.g., hardwired) or temporarily ortransitorily configured (e.g., programmed) to operate in a certainmanner and/or to perform certain operations described herein.Considering embodiments in which hardware-implemented modules aretemporarily configured (e.g., programmed), each of thehardware-implemented modules need not be configured or instantiated atany one instance in time. For example, where the hardware-implementedmodules comprise a general-purpose processor configured using software,the general-purpose processor may be configured as respective differenthardware-implemented modules at different times. Software mayaccordingly configure a processor, for example, to constitute aparticular hardware-implemented module at one instance of time and toconstitute a different hardware-implemented module at a differentinstance of time.

Hardware-implemented modules may provide information to, and receiveinformation from, other hardware-implemented modules. Accordingly, thedescribed hardware-implemented modules may be regarded as beingcommunicatively coupled. Where multiple of such hardware-implementedmodules exist contemporaneously, communications may be achieved throughsignal transmission (e.g., over appropriate circuits and buses) thatconnect the hardware-implemented modules. In embodiments in whichmultiple hardware-implemented modules are configured or instantiated atdifferent times, communications between such hardware-implementedmodules may be achieved, for example, through the storage and retrievalof information in memory structures to which the multiplehardware-implemented modules have access. For example, onehardware-implemented module may perform an operation, and store theoutput of that operation in a memory device to which it iscommunicatively coupled. A further hardware-implemented module may then,at a later time, access the memory device to retrieve and process thestored output. Hardware-implemented modules may also initiatecommunications with input or output devices, and may operate on aresource (e.g., a collection of information).

The various operations of example methods described herein may beperformed, at least partially, by one or more processors that aretemporarily configured (e.g., by software) or permanently configured toperform the relevant operations. Whether temporarily or permanentlyconfigured, such processors may constitute processor-implemented modulesthat operate to perform one or more operations or functions. The modulesreferred to herein may, in some example embodiments, compriseprocessor-implemented modules.

Similarly, the methods described herein may be at least partiallyprocessor-implemented. For example, at least some of the operations of amethod may be performed by one or processors or processor-implementedmodules. The performance of certain of the operations may be distributedamong the one or more processors, not only residing within a singlemachine, but deployed across a number of machines. In some exampleembodiments, the processor or processors may be located in a singlelocation (e.g., within a home environment, an office environment or as aserver farm), while in other embodiments the processors may bedistributed across a number of locations.

The one or more processors may also operate to support performance ofthe relevant operations in a “cloud computing” environment or as a“software as a service” (SaaS). For example, at least some of theoperations may be performed by a group of computers (as examples ofmachines including processors), these operations being accessible via anetwork (e.g., the Internet) and via one or more appropriate interfaces(e.g., Application Program Interfaces (APIs).)

Electronic Apparatus and System

Example embodiments may be implemented in digital electronic circuitry,or in computer hardware, firmware, software, or in combinations of them.Example embodiments may be implemented using a computer program product,e.g., a computer program tangibly embodied in an information carrier,e.g., in a machine-readable medium for execution by, or to control theoperation of, data processing apparatus, e.g., a programmable processor,a computer, or multiple computers.

A computer program may be written in any form of programming language,including compiled or interpreted languages, and it may be deployed inany form, including as a stand-alone program or as a module, subroutine,or other unit suitable for use in a computing environment. A computerprogram may be deployed to be executed on one computer or on multiplecomputers at one site or distributed across multiple sites andinterconnected by a communication network.

In example embodiments, operations may be performed by one or moreprogrammable processors executing a computer program to performfunctions by operating on input data and generating output. Methodoperations may also be performed by, and apparatus of exampleembodiments may be implemented as, special purpose logic circuitry,e.g., an FPGA or an ASIC.

The computing system may include clients and servers. A client andserver are generally remote from each other and typically interactthrough a communication network. The relationship of client and serverarises by virtue of computer programs running on the respectivecomputers and having a client-server relationship to each other. Inembodiments deploying a programmable computing system, it will beappreciated that that both hardware and software architectures requireconsideration. Specifically, it will be appreciated that the choice ofwhether to implement certain functionality in permanently configuredhardware (e.g., an ASIC), in temporarily configured hardware (e.g., acombination of software and a programmable processor), or a combinationof permanently and temporarily configured hardware may be a designchoice.

Although an embodiment has been described with reference to specificexample embodiments, it will be evident that various modifications andchanges may be made to these embodiments without departing from thebroader spirit and scope of the invention. Accordingly, thespecification and drawings are to be regarded in an illustrative ratherthan a restrictive sense. The accompanying drawings that form a parthereof, show by way of illustration, and not of limitation, specificembodiments in which the subject matter may be practiced. Theembodiments illustrated are described in sufficient detail to enablethose skilled in the art to practice the teachings disclosed herein.Other embodiments may be utilized and derived therefrom, such thatstructural and logical substitutions and changes may be made withoutdeparting from the scope of this disclosure. This Detailed Description,therefore, is not to be taken in a limiting sense, and the scope ofvarious embodiments is defined only by the claims, along with the fullrange of equivalents to which such claims are entitled.

What is claimed is:
 1. A method for quantifying consistency between ahierarchical decomposition of a physical system and information exchangeinterfaces between parts of the physical system of a computer systemarchitecture, the method comprising: extracting information from one ormore source databases comprising information pertaining to the computersystem architecture, the extracted information pertaining to a pluralityof parts of a parts hierarchy of the computer system architecture and aplurality of information exchange interfaces between parts of theplurality of parts of an interface hierarchy of the computer systemarchitecture; generating a first data structure representing a firstweighted property graph data model, the first data structure including aplurality of first vertices representing the plurality of parts, aplurality of first weighted compositional edges connecting differentpairs of first vertices of the plurality of first vertices andrepresenting hierarchical directed-compositions ordirected-decompositions of the plurality of parts, and a plurality offirst weighted interface edges connecting different pairs of firstvertices of the plurality of first vertices and representing theinformation exchange interfaces between the plurality of parts;generating a second data structure equivalent to the first datastructure except not including any of the plurality of first weightedinterface edges; generating a combined compositional and interface edgebetweenness hierarchical cluster of the first data structure; generatinga compositional edge betweenness hierarchical cluster of the second datastructure; and calculating a correlation between the combinedcompositional and interface edge betweenness hierarchical cluster andthe compositional edge betweenness hierarchical cluster.
 2. The methodof claim 1, wherein the one or more source databases includes a propertygraph data model in a third data structure comprising a plurality ofvertices of different vertex types, a plurality of compositional edgesthat connect vertices of a same vertex type and represent hierarchicaldirected-composition and directed-decomposition within the same vertextype, and a plurality of connecting edges that connect vertices ofdifferent vertex types.
 3. The method of claim 1, wherein the pluralityof weighted compositional edges represent physical integration of partsof the parts hierarchy of the computer system architecture, and theplurality of weighted interface edges represent information exchangeinterfaces between pairs of parts of the parts hierarchy of the computersystem architecture.
 4. The method of claim 1, wherein generating thesecond data structure includes creating a copy of the first datastructure and removing the plurality of first weighted interface edgesfrom the copy of the first data structure.
 5. The method of claim 1,wherein: generating a combined compositional and interface edgebetweenness hierarchical cluster of the first data structure includesperforming a Newman and Girvan 2004 computation on the first datastructure; and generating a compositional edge betweenness hierarchicalcluster of the second data structure includes performing a Newman andGirvan 2004 computation on the second data structure.
 6. The method ofclaim 1, wherein calculating the correlation between the combinedcompositional and interface edge betweenness hierarchical cluster andthe compositional edge betweenness hierarchical cluster includesperforming a Baker's Gamma correlation 1974 computation on the combinedcompositional and interface edge betweenness hierarchical cluster andthe compositional edge betweenness hierarchical cluster.
 7. The methodof claim 1, further comprising: performing the method of claim 1 foreach of a plurality of computer system architectures; and outputting aplot of the correlation corresponding to each of the plurality ofcomputer system architectures.
 8. A system for quantifying consistencybetween a hierarchical decomposition of a physical system andinformation exchange interfaces between parts of the physical system ofa computer system architecture, the system comprising instructionsexecuted by a processor that configure the system to implement: adatabase parser that accesses one or more source databases comprisinginformation pertaining to the computer system architecture; a firstinformation extractor that extracts information from the one or moresource databases pertaining to a plurality of parts of a parts hierarchyof the computer system architecture; a second information extractor thatextracts information from the one or more source databases pertaining toa plurality of information exchange interfaces between parts of theplurality of parts of an interface hierarchy of the computer systemarchitecture; a first data structure generator that generates a firstdata structure representing a first weighted property graph data model,the first data structure including: a plurality of first vertices, eachof the plurality of first vertices representing one part of theplurality of parts; a plurality of first weighted compositional edges;each of the plurality of first weighted compositional edges connecting adifferent pair of first vertices of the plurality of first vertices andrepresenting a hierarchical directed-composition ordirected-decomposition of one part of the plurality of parts withrespect to another part of the plurality of parts, each of the pluralityof first weighted compositional edges also being assigned a weightvalue; and a plurality of first weighted interface edges, each of theplurality of first weighted interface edges connecting a different pairof first vertices of the plurality of first vertices and representing aconnection between a corresponding pair of parts of the plurality ofparts according to one or more information exchange interfaces of theplurality of information exchange interface, each of the plurality offirst weighted compositional edges also being assigned a weight value; asecond data structure generator that generates a second data structurerepresenting a second weighted property graph data model, the seconddata structure equivalent to the first data structure except notincluding any of the plurality of first weighted interface edges, thesecond data structure including: a plurality of second vertices, each ofthe plurality of second vertices representing one part of the pluralityof parts; and a plurality of second weighted compositional edges, eachof the plurality of second weighted compositional edges connecting adifferent pair of second vertices of the plurality of second verticesand representing a hierarchical directed-composition ordirected-decomposition of one part of the plurality of parts withrespect to another part of the plurality of parts, each of the pluralityof second weighted compositional edges also being assigned a weightvalue; a first cluster generator that generates a combined compositionaland interface edge betweenness hierarchical cluster of the first datastructure; a second cluster generator that generates a compositionaledge betweenness hierarchical cluster of the second data structure; anda correlation calculator that calculates a correlation between thecombined compositional and interface edge betweenness hierarchicalcluster and the compositional edge betweenness hierarchical cluster. 9.The system of claim 8, wherein the one or more source databases includesa property graph data model in a third data structure comprising aplurality of vertices of different vertex types, a plurality ofcompositional edges that connect vertices of a same vertex type andrepresent hierarchical directed-composition and directed-decompositionwithin the same vertex type, and a plurality of connecting edges thatconnect vertices of different vertex types.
 10. The system of claim 9,wherein the plurality of weighted compositional edges represent physicalintegration of parts of the parts hierarchy of the computer systemarchitecture, and the plurality of weighted interface edges representinformation exchange interfaces between pairs of parts of the partshierarchy of the computer system architecture.
 11. The system of claim8, wherein: the first cluster generator generates the combinedcompositional and interface edge betweenness hierarchical cluster of thefirst data structure by performing a Newman and Girvan 2004 computationon the first data structure; and the second cluster generator generatesthe compositional edge betweenness hierarchical cluster of the seconddata structure by performing a Newman and Girvan 2004 computation on thesecond data structure.
 12. The system of claim 8, wherein thecorrelation calculator calculates the correlation between the combinedcompositional and interface edge betweenness hierarchical cluster andthe compositional edge betweenness hierarchical cluster by performing aBaker's Gamma correlation 1974 computation on the combined compositionaland interface edge betweenness hierarchical cluster and thecompositional edge betweenness hierarchical cluster.
 13. The system ofclaim 8, wherein the correlation represents a physical versusinformation exchange consistency of the computer system architecture.14. The system of claim 8, further comprising a correlation plotter thatoutputs a plot of the correlation corresponding to each of a pluralityof system architectures.
 15. At least one non-transitorymachine-readable medium including instructions that, when executed by amachine, cause the machine to perform the following operations forquantifying consistency between a hierarchical decomposition of aphysical system and information exchange interfaces between parts of thephysical system of a computer system architecture, the operationscomprising: accessing, by a computing processor, one or more sourcedatabases comprising information pertaining to the computer systemarchitecture; extracting information from the one or more sourcedatabases pertaining to a plurality of parts of a parts hierarchy of thecomputer system architecture; extracting information from the one ormore source databases pertaining to a plurality of information exchangeinterfaces of an interface hierarchy of the computer systemarchitecture; generating a first data structure representing a firstweighted property graph data model, the first data structure including:a plurality of first vertices, each of the plurality of first verticesrepresenting one part of the plurality of parts; a plurality of firstweighted compositional edges, each of the plurality of first weightedcompositional edges connecting a different pair of first vertices of theplurality of first vertices and representing a hierarchicaldirected-composition or directed-decomposition of one part of theplurality of parts with respect to another part of the plurality ofparts, each of the plurality of first weighted compositional edges alsobeing assigned a weight value; and a plurality of first weightedinterface edges, each of the plurality of first weighted interface edgesconnecting a different pair of first vertices of the plurality of firstvertices and representing a connection between a corresponding pair ofparts of the plurality of parts according to one or more informationexchange interfaces of the plurality of information exchange interfaces,each of the plurality of first weighted compositional edges also beingassigned a weight value; generating a second data structure representinga second weighted property graph data model, the second data structureequivalent to the first data structure except not including any of theplurality of first weighted interface edges, the second data structureincluding: a plurality of second vertices, each of the plurality ofsecond vertices representing one part of the plurality of parts; and aplurality of second weighted compositional edges, each of the pluralityof second weighted compositional edges connecting a different pair ofsecond vertices of the plurality of second vertices and representing ahierarchical directed-composition or directed-decomposition of one partof the plurality of parts with respect to another part of the pluralityof parts, each of the plurality of second weighted compositional edgesalso being assigned a weight value; generating a combined compositionaland interface edge betweenness hierarchical cluster of the first datastructure; generating a compositional edge betweenness hierarchicalcluster of the second data structure; and calculating a correlationbetween the combined compositional and interface edge betweennesshierarchical cluster and the compositional edge betweenness hierarchicalcluster.
 16. The non-transitory machine-readable medium of claim 15,wherein the one or more source databases includes a property graph datamodel in a third data structure comprising a plurality of vertices ofdifferent vertex types, a plurality of compositional edges that connectvertices of a same vertex type and represent hierarchicaldirected-composition and directed-decomposition within the same vertextype, and a plurality of connecting edges that connect vertices ofdifferent vertex types.
 17. The non-transitory machine-readable mediumof claim 15, wherein: generating a combined compositional and interfaceedge betweenness hierarchical cluster of the first data structureincludes performing a Newman and Girvan 2004 computation on the firstdata structure; generating a compositional edge betweenness hierarchicalcluster of the second data structure includes performing a Newman andGirvan 2004 computation on the second data structure; and calculatingthe correlation between the combined compositional and interface edgebetweenness hierarchical cluster and the compositional edge betweennesshierarchical cluster includes performing a Baker's Gamma correlation1974 computation on the combined compositional and interface edgebetweenness hierarchical cluster and the compositional edge betweennesshierarchical cluster.